YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:21:55,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:21:55,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:21:55,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:21:55,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:21:55,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:21:55,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:21:55,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:21:55,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:21:55,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:21:55,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:21:55,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:21:55,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:21:55,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:21:55,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:21:55,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:21:55,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:21:55,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:21:55,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:21:55,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:21:55,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:21:55,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:21:55,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:21:55,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:21:55,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:21:55,484 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:21:55,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:21:55,485 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:21:55,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:21:55,486 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:21:55,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:21:55,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:21:55,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:21:55,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:21:55,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:21:55,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:21:55,490 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:21:55,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:21:55,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:21:55,491 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:21:55,505 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:21:55,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:21:55,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:21:55,507 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:21:55,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:21:55,508 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:21:55,508 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:21:55,508 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:21:55,508 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:21:55,508 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:21:55,509 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:21:55,509 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:21:55,509 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:21:55,509 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:21:55,509 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:21:55,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:21:55,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:21:55,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:21:55,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:21:55,510 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:21:55,510 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:21:55,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:21:55,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:21:55,511 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:21:55,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:21:55,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:21:55,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:21:55,511 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:21:55,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:21:55,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:21:55,549 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:21:55,553 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:21:55,554 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:21:55,554 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:21:55,555 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:21:55,621 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/15c56cbceaa64b3ab16b88c068cc4d64/FLAGf87fccd69 [2020-06-22 09:21:55,973 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:21:55,974 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:21:55,974 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:21:55,981 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/15c56cbceaa64b3ab16b88c068cc4d64/FLAGf87fccd69 [2020-06-22 09:21:56,374 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/15c56cbceaa64b3ab16b88c068cc4d64 [2020-06-22 09:21:56,385 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:21:56,387 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:21:56,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:21:56,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:21:56,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:21:56,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd2aa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56, skipping insertion in model container [2020-06-22 09:21:56,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:21:56,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:21:56,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:21:56,667 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:21:56,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:21:56,703 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:21:56,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56 WrapperNode [2020-06-22 09:21:56,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:21:56,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:21:56,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:21:56,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:21:56,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:21:56,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:21:56,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:21:56,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:21:56,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... [2020-06-22 09:21:56,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:21:56,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:21:56,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:21:56,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:21:56,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:21:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:21:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:21:56,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:21:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:21:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:21:56,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:21:57,092 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:21:57,093 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:21:57,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:21:57 BoogieIcfgContainer [2020-06-22 09:21:57,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:21:57,095 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:21:57,095 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:21:57,097 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:21:57,098 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:21:57" (1/1) ... [2020-06-22 09:21:57,114 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 40 edges [2020-06-22 09:21:57,116 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:21:57,116 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:21:57,117 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:21:57,117 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:21:57,119 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:21:57,120 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:21:57,120 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:21:57,143 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:21:57,175 INFO L200 BlockEncoder]: SBE split 17 edges [2020-06-22 09:21:57,180 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:21:57,182 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:21:57,210 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:21:57,213 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 09:21:57,214 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:21:57,215 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:21:57,215 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:21:57,216 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:21:57,216 INFO L313 BlockEncoder]: Encoded RCFG 27 locations, 48 edges [2020-06-22 09:21:57,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:21:57 BasicIcfg [2020-06-22 09:21:57,217 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:21:57,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:21:57,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:21:57,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:21:57,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:21:56" (1/4) ... [2020-06-22 09:21:57,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2007939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:21:57, skipping insertion in model container [2020-06-22 09:21:57,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (2/4) ... [2020-06-22 09:21:57,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2007939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:21:57, skipping insertion in model container [2020-06-22 09:21:57,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:21:57" (3/4) ... [2020-06-22 09:21:57,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2007939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:21:57, skipping insertion in model container [2020-06-22 09:21:57,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:21:57" (4/4) ... [2020-06-22 09:21:57,225 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:21:57,235 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:21:57,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 09:21:57,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 09:21:57,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:21:57,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:21:57,288 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:21:57,288 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:21:57,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:21:57,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:21:57,289 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:21:57,289 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:21:57,289 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:21:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-06-22 09:21:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:21:57,310 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:57,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:21:57,311 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash 177628423, now seen corresponding path program 1 times [2020-06-22 09:21:57,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:57,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:21:57,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:21:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:21:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:21:57,530 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2020-06-22 09:21:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:57,661 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-06-22 09:21:57,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:21:57,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:21:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:57,676 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:21:57,676 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:21:57,680 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 [2020-06-22 09:21:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:21:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:21:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:21:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 09:21:57,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 5 [2020-06-22 09:21:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:57,721 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 09:21:57,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:21:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-06-22 09:21:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:21:57,722 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:57,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:21:57,723 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash 177628424, now seen corresponding path program 1 times [2020-06-22 09:21:57,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:57,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:57,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:57,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:57,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:57,760 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 4 states. [2020-06-22 09:21:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:57,832 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. [2020-06-22 09:21:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:57,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:21:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:57,833 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:21:57,833 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 09:21:57,834 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 [2020-06-22 09:21:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 09:21:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 09:21:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 09:21:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2020-06-22 09:21:57,839 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 5 [2020-06-22 09:21:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:57,839 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. [2020-06-22 09:21:57,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. [2020-06-22 09:21:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:21:57,840 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:57,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:21:57,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 177628421, now seen corresponding path program 1 times [2020-06-22 09:21:57,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:57,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:57,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:57,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:21:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:21:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:21:57,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:21:57,872 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 3 states. [2020-06-22 09:21:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:57,954 INFO L93 Difference]: Finished difference Result 26 states and 46 transitions. [2020-06-22 09:21:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:21:57,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:21:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:57,955 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:21:57,955 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:21:57,956 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 [2020-06-22 09:21:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:21:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:21:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:21:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2020-06-22 09:21:57,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 5 [2020-06-22 09:21:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:57,960 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 09:21:57,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:21:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. [2020-06-22 09:21:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:21:57,961 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:57,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:21:57,961 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512521, now seen corresponding path program 1 times [2020-06-22 09:21:57,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:57,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:57,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:57,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:21:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:21:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:21:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:21:57,999 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. [2020-06-22 09:21:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,062 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. [2020-06-22 09:21:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:21:58,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:21:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,063 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:21:58,064 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:21:58,064 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 [2020-06-22 09:21:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:21:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:21:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:21:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2020-06-22 09:21:58,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 6 [2020-06-22 09:21:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,068 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 42 transitions. [2020-06-22 09:21:58,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:21:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2020-06-22 09:21:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:21:58,069 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,069 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512523, now seen corresponding path program 1 times [2020-06-22 09:21:58,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:21:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:21:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:21:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:21:58,105 INFO L87 Difference]: Start difference. First operand 24 states and 42 transitions. Second operand 3 states. [2020-06-22 09:21:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,175 INFO L93 Difference]: Finished difference Result 25 states and 42 transitions. [2020-06-22 09:21:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:21:58,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:21:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,176 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:21:58,177 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:21:58,177 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 [2020-06-22 09:21:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:21:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:21:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:21:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2020-06-22 09:21:58,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 6 [2020-06-22 09:21:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,181 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2020-06-22 09:21:58,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:21:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-06-22 09:21:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:21:58,182 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1211512524, now seen corresponding path program 1 times [2020-06-22 09:21:58,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:58,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:58,227 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 4 states. [2020-06-22 09:21:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,298 INFO L93 Difference]: Finished difference Result 24 states and 41 transitions. [2020-06-22 09:21:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:58,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:21:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,300 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:21:58,300 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:21:58,300 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 [2020-06-22 09:21:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:21:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:21:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:21:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2020-06-22 09:21:58,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 6 [2020-06-22 09:21:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,304 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2020-06-22 09:21:58,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2020-06-22 09:21:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:21:58,305 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,305 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816480, now seen corresponding path program 1 times [2020-06-22 09:21:58,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:58,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:58,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:58,355 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 4 states. [2020-06-22 09:21:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,435 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. [2020-06-22 09:21:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:58,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:21:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,436 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:21:58,436 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 09:21:58,436 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 [2020-06-22 09:21:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 09:21:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 09:21:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 09:21:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2020-06-22 09:21:58,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 7 [2020-06-22 09:21:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,440 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. [2020-06-22 09:21:58,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. [2020-06-22 09:21:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:21:58,440 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,441 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816478, now seen corresponding path program 1 times [2020-06-22 09:21:58,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:58,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:58,474 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 4 states. [2020-06-22 09:21:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,566 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. [2020-06-22 09:21:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:58,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:21:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,567 INFO L225 Difference]: With dead ends: 34 [2020-06-22 09:21:58,567 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 09:21:58,568 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 [2020-06-22 09:21:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 09:21:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2020-06-22 09:21:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:21:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. [2020-06-22 09:21:58,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 7 [2020-06-22 09:21:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,573 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 48 transitions. [2020-06-22 09:21:58,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 48 transitions. [2020-06-22 09:21:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:21:58,574 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,574 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1097816477, now seen corresponding path program 1 times [2020-06-22 09:21:58,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:21:58,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:21:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:21:58,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:21:58,632 INFO L87 Difference]: Start difference. First operand 25 states and 48 transitions. Second operand 6 states. [2020-06-22 09:21:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,732 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2020-06-22 09:21:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:21:58,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 09:21:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,733 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:21:58,733 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:21:58,734 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 [2020-06-22 09:21:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:21:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-06-22 09:21:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:21:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2020-06-22 09:21:58,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 7 [2020-06-22 09:21:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,738 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 46 transitions. [2020-06-22 09:21:58,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:21:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 46 transitions. [2020-06-22 09:21:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:21:58,739 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,739 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash 327428438, now seen corresponding path program 1 times [2020-06-22 09:21:58,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:21:58,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:21:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:21:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:21:58,801 INFO L87 Difference]: Start difference. First operand 25 states and 46 transitions. Second operand 6 states. [2020-06-22 09:21:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:58,917 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-06-22 09:21:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:21:58,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 09:21:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:58,918 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:21:58,918 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 09:21:58,919 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 [2020-06-22 09:21:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 09:21:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-06-22 09:21:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:21:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2020-06-22 09:21:58,923 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 8 [2020-06-22 09:21:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. [2020-06-22 09:21:58,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:21:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. [2020-06-22 09:21:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:21:58,924 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:58,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:58,924 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 327428436, now seen corresponding path program 1 times [2020-06-22 09:21:58,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:58,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:58,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:58,954 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2020-06-22 09:21:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,021 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. [2020-06-22 09:21:59,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:59,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 09:21:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,022 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:21:59,022 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:21:59,022 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 [2020-06-22 09:21:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:21:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:21:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:21:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2020-06-22 09:21:59,037 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 8 [2020-06-22 09:21:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,037 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. [2020-06-22 09:21:59,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2020-06-22 09:21:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:21:59,038 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,038 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1126074271, now seen corresponding path program 1 times [2020-06-22 09:21:59,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:59,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:59,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:59,072 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand 4 states. [2020-06-22 09:21:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,139 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2020-06-22 09:21:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:59,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:21:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,140 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:21:59,140 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:21:59,140 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 [2020-06-22 09:21:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:21:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:21:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:21:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 09:21:59,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 10 [2020-06-22 09:21:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,144 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 09:21:59,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 09:21:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:21:59,145 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,145 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1126074273, now seen corresponding path program 1 times [2020-06-22 09:21:59,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:59,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:21:59,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:21:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:21:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:21:59,233 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 7 states. [2020-06-22 09:21:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,353 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2020-06-22 09:21:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:21:59,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-06-22 09:21:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,354 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:21:59,354 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:21:59,354 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 [2020-06-22 09:21:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:21:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-06-22 09:21:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:21:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-06-22 09:21:59,358 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 10 [2020-06-22 09:21:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,358 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-06-22 09:21:59,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:21:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-06-22 09:21:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:21:59,359 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,359 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 548616352, now seen corresponding path program 1 times [2020-06-22 09:21:59,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:59,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:21:59,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:21:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:21:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:21:59,393 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 4 states. [2020-06-22 09:21:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,464 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-06-22 09:21:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:21:59,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 09:21:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,465 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:21:59,466 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:21:59,466 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 [2020-06-22 09:21:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:21:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:21:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:21:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2020-06-22 09:21:59,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 11 [2020-06-22 09:21:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,470 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2020-06-22 09:21:59,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:21:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2020-06-22 09:21:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:21:59,470 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,471 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash 548616354, now seen corresponding path program 1 times [2020-06-22 09:21:59,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 09:21:59,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:21:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:21:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:21:59,537 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 7 states. [2020-06-22 09:21:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,653 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-06-22 09:21:59,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:21:59,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 09:21:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,654 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:21:59,654 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:21:59,654 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 [2020-06-22 09:21:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:21:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:21:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:21:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2020-06-22 09:21:59,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 11 [2020-06-22 09:21:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,658 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 36 transitions. [2020-06-22 09:21:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:21:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2020-06-22 09:21:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:21:59,658 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,659 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash 548616355, now seen corresponding path program 1 times [2020-06-22 09:21:59,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:21:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:21:59,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:21:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:21:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:21:59,734 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. Second operand 8 states. [2020-06-22 09:21:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:21:59,899 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-06-22 09:21:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:21:59,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 09:21:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:21:59,900 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:21:59,901 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:21:59,901 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 [2020-06-22 09:21:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:21:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2020-06-22 09:21:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:21:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-06-22 09:21:59,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 11 [2020-06-22 09:21:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:21:59,905 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-06-22 09:21:59,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:21:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-06-22 09:21:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:21:59,905 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:21:59,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:21:59,906 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:21:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:21:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -174459913, now seen corresponding path program 1 times [2020-06-22 09:21:59,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:21:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:21:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:21:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:21:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:21:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:21:59,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:21:59,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:21:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:00,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 09:22:00,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:22:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 09:22:00,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:22:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:22:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:22:00,072 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 7 states. [2020-06-22 09:22:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:00,191 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-06-22 09:22:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:22:00,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-06-22 09:22:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:00,192 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:22:00,192 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:22:00,193 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 [2020-06-22 09:22:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:22:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-06-22 09:22:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:22:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2020-06-22 09:22:00,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2020-06-22 09:22:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2020-06-22 09:22:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:22:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2020-06-22 09:22:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:22:00,197 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:00,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:00,197 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -174459912, now seen corresponding path program 1 times [2020-06-22 09:22:00,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 09:22:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:22:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:22:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:22:00,347 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2020-06-22 09:22:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:00,631 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2020-06-22 09:22:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:22:00,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 09:22:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:00,632 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:22:00,632 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:22:00,633 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 [2020-06-22 09:22:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:22:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:22:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:22:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-06-22 09:22:00,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2020-06-22 09:22:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:00,635 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-06-22 09:22:00,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:22:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-06-22 09:22:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:22:00,636 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:00,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:00,636 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1270346693, now seen corresponding path program 1 times [2020-06-22 09:22:00,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:00,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:00,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:00,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:00,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:00,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:00,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:00,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:00,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 09:22:00,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:00,973 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 [2020-06-22 09:22:00,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:00,987 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:00,988 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. [2020-06-22 09:22:00,989 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2020-06-22 09:22:01,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:22:01,046 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 09:22:01,047 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:01,067 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:01,069 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. [2020-06-22 09:22:01,069 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:42 [2020-06-22 09:22:01,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:22:01,175 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:01,176 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 [2020-06-22 09:22:01,179 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:22:01,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:01,204 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:01,204 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:54, output treesize:27 [2020-06-22 09:22:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:01,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 09:22:01,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:22:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:22:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:22:01,312 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 15 states. [2020-06-22 09:22:02,044 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2020-06-22 09:22:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:02,768 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2020-06-22 09:22:02,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 09:22:02,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-06-22 09:22:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:02,770 INFO L225 Difference]: With dead ends: 50 [2020-06-22 09:22:02,770 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 09:22:02,771 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 [2020-06-22 09:22:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 09:22:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2020-06-22 09:22:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:22:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2020-06-22 09:22:02,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 12 [2020-06-22 09:22:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-22 09:22:02,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:22:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2020-06-22 09:22:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 09:22:02,776 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:02,776 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:02,776 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash -726040962, now seen corresponding path program 1 times [2020-06-22 09:22:02,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:02,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:02,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:02,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:02,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:02,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:02,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:02,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:02,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 09:22:02,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:02,990 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 [2020-06-22 09:22:02,991 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:03,000 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:03,001 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. [2020-06-22 09:22:03,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 09:22:03,179 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:03,180 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 [2020-06-22 09:22:03,194 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:22:03,243 INFO L497 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2020-06-22 09:22:03,250 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:22:03,251 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:23 [2020-06-22 09:22:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:03,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:03,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-06-22 09:22:03,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 09:22:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 09:22:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-06-22 09:22:03,333 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 16 states. [2020-06-22 09:22:03,678 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-06-22 09:22:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:04,003 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-06-22 09:22:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:22:04,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-06-22 09:22:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:04,004 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:22:04,004 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:22:04,005 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 [2020-06-22 09:22:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:22:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-06-22 09:22:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:22:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-06-22 09:22:04,010 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2020-06-22 09:22:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:04,010 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-06-22 09:22:04,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 09:22:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-06-22 09:22:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 09:22:04,011 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:04,011 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:04,011 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -726040961, now seen corresponding path program 1 times [2020-06-22 09:22:04,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:04,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:04,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:04,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:22:04,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:04,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:22:04,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:22:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:22:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:22:04,149 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2020-06-22 09:22:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:04,296 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-06-22 09:22:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:22:04,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-06-22 09:22:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:04,296 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:22:04,297 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:22:04,297 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 [2020-06-22 09:22:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:22:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:22:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:22:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-06-22 09:22:04,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 13 [2020-06-22 09:22:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:04,301 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-06-22 09:22:04,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:22:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-06-22 09:22:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:22:04,302 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:04,302 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:04,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1940704567, now seen corresponding path program 1 times [2020-06-22 09:22:04,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:04,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:04,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:04,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 09:22:04,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:04,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:22:04,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2020-06-22 09:22:04,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:22:04,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:22:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:22:04,433 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 6 states. [2020-06-22 09:22:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:04,509 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-06-22 09:22:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:22:04,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-06-22 09:22:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:04,510 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:22:04,510 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:22:04,510 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 [2020-06-22 09:22:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:22:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 09:22:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:22:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-06-22 09:22:04,514 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-06-22 09:22:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:04,514 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 09:22:04,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:22:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-06-22 09:22:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:22:04,515 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:04,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:04,515 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1940704566, now seen corresponding path program 1 times [2020-06-22 09:22:04,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:04,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:04,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:22:04,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:22:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:22:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:22:04,540 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 4 states. [2020-06-22 09:22:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:04,581 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-06-22 09:22:04,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:22:04,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-06-22 09:22:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:04,582 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:22:04,582 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:22:04,582 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 [2020-06-22 09:22:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:22:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:22:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:22:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-06-22 09:22:04,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2020-06-22 09:22:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:04,586 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 09:22:04,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:22:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-06-22 09:22:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 09:22:04,587 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:04,587 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:04,588 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -32247173, now seen corresponding path program 1 times [2020-06-22 09:22:04,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:04,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:04,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:22:04,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:22:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:22:04,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:22:04,642 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 6 states. [2020-06-22 09:22:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:04,750 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 09:22:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:22:04,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-06-22 09:22:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:04,751 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:22:04,751 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:22:04,751 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 [2020-06-22 09:22:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:22:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:22:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:22:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-06-22 09:22:04,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2020-06-22 09:22:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:04,754 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-06-22 09:22:04,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:22:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-06-22 09:22:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 09:22:04,755 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:04,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:04,755 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1001360096, now seen corresponding path program 2 times [2020-06-22 09:22:04,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:05,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:05,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:05,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:22:05,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:22:05,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:22:05,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 09:22:05,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:05,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:22:05,058 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 [2020-06-22 09:22:05,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:05,069 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:05,069 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. [2020-06-22 09:22:05,070 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-06-22 09:22:05,099 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 [2020-06-22 09:22:05,099 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:05,111 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:05,112 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. [2020-06-22 09:22:05,112 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 09:22:05,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:22:05,148 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 09:22:05,148 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:05,161 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:05,161 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. [2020-06-22 09:22:05,162 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-06-22 09:22:05,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:22:05,308 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:05,308 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 [2020-06-22 09:22:05,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:22:05,325 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:05,328 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:05,328 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:27 [2020-06-22 09:22:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2020-06-22 09:22:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:22:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:22:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:22:05,433 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 18 states. [2020-06-22 09:22:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:12,390 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-06-22 09:22:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-06-22 09:22:12,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2020-06-22 09:22:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:12,391 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:22:12,391 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 09:22:12,392 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 [2020-06-22 09:22:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 09:22:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2020-06-22 09:22:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 09:22:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2020-06-22 09:22:12,398 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 17 [2020-06-22 09:22:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:12,399 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-06-22 09:22:12,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:22:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2020-06-22 09:22:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 09:22:12,399 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:12,400 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:12,400 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -977391047, now seen corresponding path program 2 times [2020-06-22 09:22:12,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:12,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:12,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:22:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:12,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:12,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:22:12,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:22:12,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:22:12,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjunts are in the unsatisfiable core [2020-06-22 09:22:12,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:12,753 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:12,754 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 [2020-06-22 09:22:12,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:12,780 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 09:22:12,781 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:12,781 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 09:22:12,807 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 [2020-06-22 09:22:12,807 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:12,814 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:12,814 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. [2020-06-22 09:22:12,814 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 09:22:13,017 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:13,018 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 [2020-06-22 09:22:13,027 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 09:22:13,073 INFO L497 ElimStorePlain]: treesize reduction 34, result has 57.5 percent of original size [2020-06-22 09:22:13,077 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:22:13,078 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 [2020-06-22 09:22:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:22:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-06-22 09:22:13,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:22:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:22:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:22:13,152 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 18 states. [2020-06-22 09:22:14,146 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-06-22 09:22:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:14,687 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-06-22 09:22:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-06-22 09:22:14,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-06-22 09:22:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:14,688 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:22:14,688 INFO L226 Difference]: Without dead ends: 50 [2020-06-22 09:22:14,689 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 [2020-06-22 09:22:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-06-22 09:22:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-06-22 09:22:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 09:22:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2020-06-22 09:22:14,696 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 18 [2020-06-22 09:22:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:14,696 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-06-22 09:22:14,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:22:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2020-06-22 09:22:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 09:22:14,697 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:14,698 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:14,698 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1169765660, now seen corresponding path program 1 times [2020-06-22 09:22:14,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:22:14,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 09:22:14,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:14,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:14,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2020-06-22 09:22:14,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:14,937 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 [2020-06-22 09:22:14,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:14,943 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:14,946 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2020-06-22 09:22:14,946 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:14,952 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:14,953 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:14,953 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 09:22:14,973 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 [2020-06-22 09:22:14,974 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:14,979 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:14,979 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:14,980 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 09:22:15,000 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 [2020-06-22 09:22:15,000 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:15,006 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:15,007 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. [2020-06-22 09:22:15,007 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 09:22:15,705 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:15,706 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 [2020-06-22 09:22:15,706 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:22:15,717 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:15,718 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:22:15,718 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-06-22 09:22:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 09:22:15,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:15,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 09:22:15,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:22:15,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:22:15,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=169, Unknown=1, NotChecked=0, Total=210 [2020-06-22 09:22:15,781 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 15 states. [2020-06-22 09:22:16,964 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-06-22 09:22:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:17,225 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2020-06-22 09:22:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:22:17,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-06-22 09:22:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:17,226 INFO L225 Difference]: With dead ends: 45 [2020-06-22 09:22:17,226 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 09:22:17,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=98, Invalid=281, Unknown=1, NotChecked=0, Total=380 [2020-06-22 09:22:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 09:22:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2020-06-22 09:22:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 09:22:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-06-22 09:22:17,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 22 [2020-06-22 09:22:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:17,231 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 09:22:17,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:22:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-06-22 09:22:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 09:22:17,232 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:17,232 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:17,232 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:22:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1983144161, now seen corresponding path program 1 times [2020-06-22 09:22:17,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:17,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:17,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 09:22:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:22:17,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:22:17,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:17,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core [2020-06-22 09:22:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:17,435 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:17,435 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 [2020-06-22 09:22:17,436 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,451 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 09:22:17,451 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,451 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 09:22:17,455 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 [2020-06-22 09:22:17,455 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,457 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:17,458 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,458 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 09:22:17,565 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:17,565 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 [2020-06-22 09:22:17,572 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 09:22:17,619 INFO L497 ElimStorePlain]: treesize reduction 58, result has 39.6 percent of original size [2020-06-22 09:22:17,621 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. [2020-06-22 09:22:17,621 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2020-06-22 09:22:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 09:22:17,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:22:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-06-22 09:22:17,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 09:22:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 09:22:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-06-22 09:22:17,703 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. [2020-06-22 09:22:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:18,105 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-06-22 09:22:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:22:18,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2020-06-22 09:22:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:18,106 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:22:18,107 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:22:18,107 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 [2020-06-22 09:22:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:22:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:22:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:22:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:22:18,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-06-22 09:22:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:18,108 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:18,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 09:22:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:22:18,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:22:18,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:22:18,259 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 200 [2020-06-22 09:22:30,781 WARN L188 SmtUtils]: Spent 12.52 s on a formula simplification. DAG size of input: 197 DAG size of output: 87 [2020-06-22 09:22:30,784 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 29) no Hoare annotation was computed. [2020-06-22 09:22:30,784 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 09:22:30,784 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-06-22 09:22:30,785 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)))) [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point L15-6(lines 15 17) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:22:30,785 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 35) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:30,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:30,787 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:22:30,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:30,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:30,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:30,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:30,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:22:30 BasicIcfg [2020-06-22 09:22:30,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:22:30,838 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:22:30,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:22:30,841 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:22:30,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:30,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:21:56" (1/5) ... [2020-06-22 09:22:30,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f2837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:22:30, skipping insertion in model container [2020-06-22 09:22:30,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:30,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:21:56" (2/5) ... [2020-06-22 09:22:30,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f2837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:22:30, skipping insertion in model container [2020-06-22 09:22:30,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:30,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:21:57" (3/5) ... [2020-06-22 09:22:30,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f2837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:30, skipping insertion in model container [2020-06-22 09:22:30,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:30,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:21:57" (4/5) ... [2020-06-22 09:22:30,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e5f2837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:30, skipping insertion in model container [2020-06-22 09:22:30,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:30,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:22:30" (5/5) ... [2020-06-22 09:22:30,845 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:22:30,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:22:30,866 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:22:30,866 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:22:30,866 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:22:30,866 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:22:30,866 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:22:30,866 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:22:30,866 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:22:30,866 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:22:30,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-06-22 09:22:30,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:22:30,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:22:30,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:22:30,880 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:22:30,880 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:30,880 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:22:30,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-06-22 09:22:30,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:22:30,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:22:30,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:22:30,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:22:30,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:30,887 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] 28#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] 9#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] 8#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 [2020-06-22 09:22:30,887 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] 27#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~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_7|, 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~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 5#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 [2020-06-22 09:22:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1213928504, now seen corresponding path program 1 times [2020-06-22 09:22:30,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:30,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:30,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:30,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 179376758, now seen corresponding path program 1 times [2020-06-22 09:22:30,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1107101855, now seen corresponding path program 1 times [2020-06-22 09:22:30,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:30,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:31,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 09:22:31,152 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-06-22 09:22:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:22:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:22:31,184 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 9 states. [2020-06-22 09:22:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:31,618 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. [2020-06-22 09:22:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:22:31,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 88 transitions. [2020-06-22 09:22:31,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:22:31,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 11 states and 16 transitions. [2020-06-22 09:22:31,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 09:22:31,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 09:22:31,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-06-22 09:22:31,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:22:31,626 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 09:22:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-06-22 09:22:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 09:22:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:22:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-06-22 09:22:31,628 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 09:22:31,628 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 09:22:31,628 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:22:31,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-06-22 09:22:31,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 09:22:31,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:22:31,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:22:31,629 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:22:31,629 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:31,630 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 [2020-06-22 09:22:31,631 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~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_7|, 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~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, 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 [2020-06-22 09:22:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1214285996, now seen corresponding path program 1 times [2020-06-22 09:22:31,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:31,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:31,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:31,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash 179376758, now seen corresponding path program 2 times [2020-06-22 09:22:31,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:31,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:31,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:31,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 892484779, now seen corresponding path program 1 times [2020-06-22 09:22:31,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:31,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:22:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:31,776 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2020-06-22 09:22:32,098 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 09:22:32,211 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-06-22 09:22:32,224 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:22:32,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:22:32,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:22:32,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:22:32,226 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:22:32,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:22:32,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:22:32,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:22:32,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:22:32,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:22:32,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:22:32,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,570 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-06-22 09:22:32,697 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 09:22:32,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:32,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:33,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:22:33,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:22:33,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:33,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:33,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:33,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:33,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:33,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:33,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:33,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:33,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:33,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:33,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:33,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:33,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:33,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:33,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:33,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:33,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:22:33,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:33,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:33,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:33,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:33,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:33,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:33,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:22:33,275 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:22:33,275 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 09:22:33,277 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:22:33,278 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:22:33,279 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:22:33,279 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2020-06-22 09:22:33,323 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 09:22:33,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:33,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:22:33,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:33,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:22:33,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:22:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:33,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:22:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:33,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:22:33,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:33,597 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 09:22:33,601 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 [2020-06-22 09:22:33,602 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 09:22:33,836 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. [2020-06-22 09:22:33,837 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 [2020-06-22 09:22:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:22:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-06-22 09:22:33,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 5 letters. [2020-06-22 09:22:33,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:33,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2020-06-22 09:22:33,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:33,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 10 letters. [2020-06-22 09:22:33,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:33,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2020-06-22 09:22:33,846 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:22:33,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:22:33,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:22:33,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:22:33,847 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:22:33,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:22:33,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:22:33,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:22:33,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:33 BasicIcfg [2020-06-22 09:22:33,855 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:22:33,855 INFO L168 Benchmark]: Toolchain (without parser) took 37469.35 ms. Allocated memory was 649.6 MB in the beginning and 926.9 MB in the end (delta: 277.3 MB). Free memory was 564.2 MB in the beginning and 621.8 MB in the end (delta: -57.6 MB). Peak memory consumption was 219.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,856 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:22:33,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.93 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 564.2 MB in the beginning and 657.1 MB in the end (delta: -92.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 693.6 MB. Free memory was 657.1 MB in the beginning and 654.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,857 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 693.6 MB. Free memory was 654.4 MB in the beginning and 653.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,857 INFO L168 Benchmark]: RCFGBuilder took 322.10 ms. Allocated memory is still 693.6 MB. Free memory was 653.0 MB in the beginning and 630.6 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,858 INFO L168 Benchmark]: BlockEncodingV2 took 122.22 ms. Allocated memory is still 693.6 MB. Free memory was 630.6 MB in the beginning and 619.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,858 INFO L168 Benchmark]: TraceAbstraction took 33619.32 ms. Allocated memory was 693.6 MB in the beginning and 903.9 MB in the end (delta: 210.2 MB). Free memory was 619.8 MB in the beginning and 679.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 437.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,859 INFO L168 Benchmark]: BuchiAutomizer took 3017.15 ms. Allocated memory was 903.9 MB in the beginning and 926.9 MB in the end (delta: 23.1 MB). Free memory was 679.1 MB in the beginning and 621.8 MB in the end (delta: 57.3 MB). Peak memory consumption was 80.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:33,862 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 36 locations, 40 edges - StatisticsResult: Encoded RCFG 27 locations, 48 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 315.93 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 564.2 MB in the beginning and 657.1 MB in the end (delta: -92.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 693.6 MB. Free memory was 657.1 MB in the beginning and 654.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 693.6 MB. Free memory was 654.4 MB in the beginning and 653.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 322.10 ms. Allocated memory is still 693.6 MB. Free memory was 653.0 MB in the beginning and 630.6 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 122.22 ms. Allocated memory is still 693.6 MB. Free memory was 630.6 MB in the beginning and 619.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 33619.32 ms. Allocated memory was 693.6 MB in the beginning and 903.9 MB in the end (delta: 210.2 MB). Free memory was 619.8 MB in the beginning and 679.1 MB in the end (delta: -59.3 MB). Peak memory consumption was 437.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3017.15 ms. Allocated memory was 903.9 MB in the beginning and 926.9 MB in the end (delta: 23.1 MB). Free memory was 679.1 MB in the beginning and 621.8 MB in the end (delta: 57.3 MB). Peak memory consumption was 80.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 09:22:33,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:22:33,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:33,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 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]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 14 error locations. SAFE Result, 33.5s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 12.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 1408 SDslu, 876 SDs, 0 SdLazy, 2735 SolverSat, 422 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 8.9s 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, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 419 ConstructedInterpolants, 45 QuantifiedInterpolants, 67400 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 37 InterpolantComputations, 21 PerfectInterpolantSequences, 66/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:21:53.168 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:22:34.118 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check