YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 11:06:12,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 11:06:12,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 11:06:12,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 11:06:12,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 11:06:12,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 11:06:12,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 11:06:12,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 11:06:12,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 11:06:12,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 11:06:12,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 11:06:12,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 11:06:12,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 11:06:12,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 11:06:12,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 11:06:12,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 11:06:12,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 11:06:12,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 11:06:12,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 11:06:12,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 11:06:12,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 11:06:12,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 11:06:12,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 11:06:12,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 11:06:12,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 11:06:12,073 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 11:06:12,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 11:06:12,074 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 11:06:12,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 11:06:12,075 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 11:06:12,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 11:06:12,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 11:06:12,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 11:06:12,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 11:06:12,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 11:06:12,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 11:06:12,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 11:06:12,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 11:06:12,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 11:06:12,080 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 11:06:12,094 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 11:06:12,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 11:06:12,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 11:06:12,096 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 11:06:12,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 11:06:12,096 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:06:12,096 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 11:06:12,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 11:06:12,097 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 11:06:12,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 11:06:12,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 11:06:12,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 11:06:12,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 11:06:12,098 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 11:06:12,098 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 11:06:12,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 11:06:12,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 11:06:12,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 11:06:12,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 11:06:12,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 11:06:12,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 11:06:12,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 11:06:12,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 11:06:12,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 11:06:12,139 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 11:06:12,142 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 11:06:12,144 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 11:06:12,144 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 11:06:12,145 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:06:12,209 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/88d9593edea3473fb5cbdca6cfec2ed9/FLAG578770361 [2020-06-22 11:06:12,545 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 11:06:12,546 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 11:06:12,546 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 11:06:12,552 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/88d9593edea3473fb5cbdca6cfec2ed9/FLAG578770361 [2020-06-22 11:06:12,948 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/88d9593edea3473fb5cbdca6cfec2ed9 [2020-06-22 11:06:12,959 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 11:06:12,961 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 11:06:12,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 11:06:12,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 11:06:12,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 11:06:12,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d766225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:12, skipping insertion in model container [2020-06-22 11:06:12,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 11:06:12" (1/1) ... [2020-06-22 11:06:12,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 11:06:12,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 11:06:13,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:06:13,230 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 11:06:13,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 11:06:13,266 INFO L195 MainTranslator]: Completed translation [2020-06-22 11:06:13,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13 WrapperNode [2020-06-22 11:06:13,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 11:06:13,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 11:06:13,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 11:06:13,268 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 11:06:13,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 11:06:13,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 11:06:13,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 11:06:13,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 11:06:13,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 11:06:13,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 11:06:13,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 11:06:13,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 11:06:13,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (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 11:06:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 11:06:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 11:06:13,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 11:06:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 11:06:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 11:06:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 11:06:13,649 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 11:06:13,650 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 11:06:13,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13 BoogieIcfgContainer [2020-06-22 11:06:13,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 11:06:13,652 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 11:06:13,652 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 11:06:13,654 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 11:06:13,655 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (1/1) ... [2020-06-22 11:06:13,671 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-06-22 11:06:13,672 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 11:06:13,673 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 11:06:13,674 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 11:06:13,674 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 11:06:13,676 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 11:06:13,676 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 11:06:13,677 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 11:06:13,696 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 11:06:13,720 INFO L200 BlockEncoder]: SBE split 8 edges [2020-06-22 11:06:13,725 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 11:06:13,727 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:06:13,756 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 11:06:13,759 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 11:06:13,760 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 11:06:13,761 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 11:06:13,761 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 11:06:13,761 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 11:06:13,762 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-06-22 11:06:13,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13 BasicIcfg [2020-06-22 11:06:13,763 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 11:06:13,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 11:06:13,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 11:06:13,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 11:06:13,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 11:06:12" (1/4) ... [2020-06-22 11:06:13,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a50b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (2/4) ... [2020-06-22 11:06:13,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a50b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (3/4) ... [2020-06-22 11:06:13,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a50b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:13, skipping insertion in model container [2020-06-22 11:06:13,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13" (4/4) ... [2020-06-22 11:06:13,771 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:06:13,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 11:06:13,789 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 11:06:13,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 11:06:13,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:06:13,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 11:06:13,835 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 11:06:13,835 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:06:13,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:06:13,835 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:06:13,835 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 11:06:13,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:06:13,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 11:06:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-06-22 11:06:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:13,856 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:13,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:13,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash 125972526, now seen corresponding path program 1 times [2020-06-22 11:06:13,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:13,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:13,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,027 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 11:06:14,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,051 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-06-22 11:06:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,121 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-06-22 11:06:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:06:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,136 INFO L225 Difference]: With dead ends: 15 [2020-06-22 11:06:14,136 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 11:06:14,139 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 11:06:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 11:06:14,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 11:06:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 11:06:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-06-22 11:06:14,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 [2020-06-22 11:06:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,177 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-06-22 11:06:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-06-22 11:06:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:14,177 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:14,178 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash 125972528, now seen corresponding path program 1 times [2020-06-22 11:06:14,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,228 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 11:06:14,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 11:06:14,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 11:06:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 11:06:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 11:06:14,231 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2020-06-22 11:06:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,288 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2020-06-22 11:06:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 11:06:14,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 11:06:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,312 INFO L225 Difference]: With dead ends: 15 [2020-06-22 11:06:14,312 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 11:06:14,313 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 11:06:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 11:06:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 11:06:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 11:06:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-06-22 11:06:14,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 [2020-06-22 11:06:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,317 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 11:06:14,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 11:06:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-06-22 11:06:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 11:06:14,317 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:14,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 125972529, now seen corresponding path program 1 times [2020-06-22 11:06:14,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,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 11:06:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,355 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. [2020-06-22 11:06:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,397 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2020-06-22 11:06:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 11:06:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,398 INFO L225 Difference]: With dead ends: 14 [2020-06-22 11:06:14,398 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 11:06:14,399 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 11:06:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 11:06:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 11:06:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:06:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-06-22 11:06:14,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 [2020-06-22 11:06:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,402 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-06-22 11:06:14,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-06-22 11:06:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 11:06:14,403 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 11:06:14,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -389818398, now seen corresponding path program 1 times [2020-06-22 11:06:14,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,465 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 11:06:14,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 11:06:14,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 11:06:14,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:06:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:06:14,467 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. [2020-06-22 11:06:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,575 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 11:06:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 11:06:14,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-06-22 11:06:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,577 INFO L225 Difference]: With dead ends: 21 [2020-06-22 11:06:14,577 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 11:06:14,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 11:06:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 11:06:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-06-22 11:06:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 11:06:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2020-06-22 11:06:14,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 6 [2020-06-22 11:06:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,582 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 26 transitions. [2020-06-22 11:06:14,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 11:06:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 26 transitions. [2020-06-22 11:06:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 11:06:14,583 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 11:06:14,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -389818401, now seen corresponding path program 1 times [2020-06-22 11:06:14,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,613 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 11:06:14,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 11:06:14,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 11:06:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 11:06:14,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 11:06:14,614 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand 3 states. [2020-06-22 11:06:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,656 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2020-06-22 11:06:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 11:06:14,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 11:06:14,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,657 INFO L225 Difference]: With dead ends: 14 [2020-06-22 11:06:14,657 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 11:06:14,657 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 11:06:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 11:06:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 11:06:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:06:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-06-22 11:06:14,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 6 [2020-06-22 11:06:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,661 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 11:06:14,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 11:06:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-06-22 11:06:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 11:06:14,661 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:14,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 800530717, now seen corresponding path program 1 times [2020-06-22 11:06:14,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,719 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 11:06:14,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 11:06:14,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 11:06:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 11:06:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 11:06:14,721 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 4 states. [2020-06-22 11:06:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,772 INFO L93 Difference]: Finished difference Result 13 states and 22 transitions. [2020-06-22 11:06:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 11:06:14,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 11:06:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,773 INFO L225 Difference]: With dead ends: 13 [2020-06-22 11:06:14,773 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 11:06:14,773 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 11:06:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 11:06:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 11:06:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 11:06:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2020-06-22 11:06:14,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 [2020-06-22 11:06:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,777 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 11:06:14,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 11:06:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2020-06-22 11:06:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 11:06:14,777 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:14,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash 800530719, now seen corresponding path program 1 times [2020-06-22 11:06:14,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,809 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 11:06:14,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 11:06:14,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 11:06:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 11:06:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 11:06:14,811 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2020-06-22 11:06:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:14,887 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-06-22 11:06:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 11:06:14,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 11:06:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:14,889 INFO L225 Difference]: With dead ends: 17 [2020-06-22 11:06:14,889 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 11:06:14,889 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 11:06:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 11:06:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-06-22 11:06:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:06:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-06-22 11:06:14,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 7 [2020-06-22 11:06:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:14,893 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 11:06:14,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 11:06:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-06-22 11:06:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 11:06:14,894 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:14,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:14,894 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 800530720, now seen corresponding path program 1 times [2020-06-22 11:06:14,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:14,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:14,954 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 11:06:14,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:14,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 11:06:14,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 11:06:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 11:06:14,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 11:06:14,955 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 5 states. [2020-06-22 11:06:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:15,043 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-06-22 11:06:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 11:06:15,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 11:06:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:15,044 INFO L225 Difference]: With dead ends: 16 [2020-06-22 11:06:15,045 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 11:06:15,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 11:06:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 11:06:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 11:06:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:06:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-06-22 11:06:15,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 7 [2020-06-22 11:06:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:15,049 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 11:06:15,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 11:06:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. [2020-06-22 11:06:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 11:06:15,049 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:15,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,050 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1344015987, now seen corresponding path program 1 times [2020-06-22 11:06:15,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:15,154 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 11:06:15,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:15,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 11:06:15,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 11:06:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 11:06:15,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 11:06:15,155 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 7 states. [2020-06-22 11:06:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:15,293 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-06-22 11:06:15,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 11:06:15,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-06-22 11:06:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:15,295 INFO L225 Difference]: With dead ends: 25 [2020-06-22 11:06:15,295 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 11:06:15,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-06-22 11:06:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 11:06:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 11:06:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 11:06:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-06-22 11:06:15,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2020-06-22 11:06:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:15,298 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-06-22 11:06:15,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 11:06:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-06-22 11:06:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 11:06:15,299 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:15,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:15,299 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555216, now seen corresponding path program 1 times [2020-06-22 11:06:15,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:15,429 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 11:06:15,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:15,430 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 11:06:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:15,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 11:06:15,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:15,529 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 11:06:15,530 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:15,543 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:15,544 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 11:06:15,544 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 11:06:15,580 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:15,581 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 11:06:15,584 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 11:06:15,597 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:15,602 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 11:06:15,603 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 11:06:15,650 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 11:06:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:15,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 11:06:15,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 11:06:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 11:06:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 11:06:15,679 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 11 states. [2020-06-22 11:06:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:15,994 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-06-22 11:06:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 11:06:15,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2020-06-22 11:06:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:15,995 INFO L225 Difference]: With dead ends: 18 [2020-06-22 11:06:15,995 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 11:06:15,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-06-22 11:06:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 11:06:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 11:06:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 11:06:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2020-06-22 11:06:15,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 25 transitions. Word has length 10 [2020-06-22 11:06:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:16,000 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 11:06:16,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 11:06:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 25 transitions. [2020-06-22 11:06:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 11:06:16,001 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:16,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:16,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555215, now seen corresponding path program 1 times [2020-06-22 11:06:16,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,034 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 11:06:16,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:16,035 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 11:06:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 11:06:16,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:16,086 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 11:06:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 11:06:16,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 11:06:16,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 11:06:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 11:06:16,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 11:06:16,114 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 6 states. [2020-06-22 11:06:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:16,186 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-06-22 11:06:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 11:06:16,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 11:06:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:16,187 INFO L225 Difference]: With dead ends: 17 [2020-06-22 11:06:16,187 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 11:06:16,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 11:06:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 11:06:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 11:06:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 11:06:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-06-22 11:06:16,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2020-06-22 11:06:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:16,192 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-06-22 11:06:16,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 11:06:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-06-22 11:06:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 11:06:16,192 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:16,192 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:16,193 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 695636017, now seen corresponding path program 1 times [2020-06-22 11:06:16,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,232 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 11:06:16,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:16,232 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 11:06:16,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 11:06:16,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 11:06:16,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 11:06:16,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 11:06:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 11:06:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 11:06:16,310 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 6 states. [2020-06-22 11:06:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:16,361 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-06-22 11:06:16,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 11:06:16,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 11:06:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:16,362 INFO L225 Difference]: With dead ends: 17 [2020-06-22 11:06:16,362 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 11:06:16,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 11:06:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 11:06:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 11:06:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 11:06:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 11:06:16,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2020-06-22 11:06:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:16,366 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 11:06:16,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 11:06:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-06-22 11:06:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 11:06:16,367 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:16,367 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:16,368 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:16,368 INFO L82 PathProgramCache]: Analyzing trace with hash 695636018, now seen corresponding path program 1 times [2020-06-22 11:06:16,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:16,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,439 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 11:06:16,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:16,439 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 11:06:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:16,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 11:06:16,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:16,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 11:06:16,486 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 11:06:16,486 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:16,497 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:16,504 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 11:06:16,505 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:16,514 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:16,515 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:16,515 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-06-22 11:06:16,613 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 11:06:16,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:16,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-06-22 11:06:16,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 11:06:16,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 11:06:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-06-22 11:06:16,640 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 11 states. [2020-06-22 11:06:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:24,702 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-06-22 11:06:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 11:06:24,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-06-22 11:06:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:24,703 INFO L225 Difference]: With dead ends: 19 [2020-06-22 11:06:24,703 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 11:06:24,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-06-22 11:06:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 11:06:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-06-22 11:06:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 11:06:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-06-22 11:06:24,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 11 [2020-06-22 11:06:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:24,707 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-06-22 11:06:24,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 11:06:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-06-22 11:06:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 11:06:24,707 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:24,708 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:24,708 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 474108219, now seen corresponding path program 2 times [2020-06-22 11:06:24,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:24,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:24,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:24,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:24,912 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 11:06:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 11:06:24,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 11:06:24,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 11:06:24,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 11:06:24,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:24,967 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 11:06:24,967 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,975 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:24,980 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 11:06:24,980 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,990 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:24,990 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:24,990 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 11:06:25,012 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 16 treesize of output 12 [2020-06-22 11:06:25,013 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:25,022 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:25,023 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 11:06:25,023 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-06-22 11:06:25,053 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 24 treesize of output 23 [2020-06-22 11:06:25,053 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:25,063 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:25,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 11:06:25,064 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:23 [2020-06-22 11:06:25,103 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:25,104 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 11:06:25,105 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 11:06:25,114 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:25,116 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:25,116 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 11:06:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 11:06:25,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:25,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-06-22 11:06:25,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 11:06:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 11:06:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-06-22 11:06:25,182 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 12 states. [2020-06-22 11:06:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:25,830 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-06-22 11:06:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 11:06:25,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2020-06-22 11:06:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:25,831 INFO L225 Difference]: With dead ends: 22 [2020-06-22 11:06:25,831 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 11:06:25,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2020-06-22 11:06:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 11:06:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-06-22 11:06:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 11:06:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-06-22 11:06:25,836 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 14 [2020-06-22 11:06:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:25,836 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 11:06:25,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 11:06:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-06-22 11:06:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 11:06:25,837 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 11:06:25,837 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 11:06:25,837 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 11:06:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1570498009, now seen corresponding path program 1 times [2020-06-22 11:06:25,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:25,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 11:06:25,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 11:06:25,975 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 11:06:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:26,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 37 conjunts are in the unsatisfiable core [2020-06-22 11:06:26,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:26,024 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 11:06:26,025 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,031 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,033 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 11:06:26,034 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,040 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,040 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 11:06:26,045 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 11:06:26,045 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,049 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,049 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,050 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 11:06:26,054 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 23 treesize of output 22 [2020-06-22 11:06:26,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,061 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,062 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,062 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 11:06:26,069 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 23 treesize of output 22 [2020-06-22 11:06:26,069 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,075 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,076 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,076 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 11:06:26,086 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,086 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 11:06:26,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 11:06:26,094 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 11:06:26,094 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 11:06:26,094 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 11:06:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 11:06:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 11:06:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-06-22 11:06:26,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 11:06:26,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 11:06:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-06-22 11:06:26,151 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 11 states. [2020-06-22 11:06:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:26,294 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 11:06:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 11:06:26,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-06-22 11:06:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 11:06:26,295 INFO L225 Difference]: With dead ends: 19 [2020-06-22 11:06:26,295 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 11:06:26,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-06-22 11:06:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 11:06:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 11:06:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 11:06:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 11:06:26,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-06-22 11:06:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 11:06:26,297 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:26,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 11:06:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:06:26,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 11:06:26,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 11:06:26,757 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2020-06-22 11:06:26,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 11:06:26,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,760 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,760 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 11 26) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 11 26) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L7-2(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,761 INFO L448 ceAbstractionStarter]: For program point L7-4(line 7) no Hoare annotation was computed. [2020-06-22 11:06:26,762 INFO L444 ceAbstractionStarter]: At program point L7-5(line 7) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse0 (not (= ULTIMATE.start_cstpcpy_~to.base ULTIMATE.start_cstpcpy_~from.base))) (.cse1 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse6 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse11 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) (+ (select |#length| ULTIMATE.start_cstpcpy_~from.base) ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse15 (<= ULTIMATE.start_main_~length2~0 .cse17)) (.cse13 (select |#length| ULTIMATE.start_cstpcpy_~to.base)) (.cse2 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse3 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse12 (select |#length| ULTIMATE.start_cstpcpy_~from.base)) (.cse4 (= ULTIMATE.start_cstpcpy_~to.offset 0)) (.cse5 (= 0 ULTIMATE.start_cstpcpy_~from.offset)) (.cse7 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse8 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse10 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~to.base))) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~from.base))) (.cse16 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstpcpy_~from.offset ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstpcpy_~from.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 1 ULTIMATE.start_main_~length2~0))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse12 .cse13) .cse14 .cse15 .cse16) (and .cse0 .cse1 (<= 1 ULTIMATE.start_cstpcpy_~from.offset) .cse2 (<= (+ ULTIMATE.start_cstpcpy_~from.offset 1) .cse12) .cse3 (<= 1 ULTIMATE.start_cstpcpy_~to.offset) .cse6 .cse7 (<= (+ ULTIMATE.start_cstpcpy_~to.offset .cse12) (+ .cse13 ULTIMATE.start_cstpcpy_~from.offset)) .cse8 .cse10 .cse9 .cse11 .cse15 .cse14 .cse16) (and (<= 1 .cse13) (<= ULTIMATE.start_main_~length1~0 1) .cse2 .cse3 (<= 1 .cse12) (<= 1 .cse17) .cse4 .cse5 .cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base) ULTIMATE.start_cstpcpy_~from.offset)) .cse8 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse10 .cse9 .cse14 .cse16)))) [2020-06-22 11:06:26,762 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 11:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:26,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:26,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:26,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:26,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:26 BasicIcfg [2020-06-22 11:06:26,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 11:06:26,805 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 11:06:26,805 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 11:06:26,808 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 11:06:26,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:26,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 11:06:12" (1/5) ... [2020-06-22 11:06:26,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d629b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:06:26, skipping insertion in model container [2020-06-22 11:06:26,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:26,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 11:06:13" (2/5) ... [2020-06-22 11:06:26,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d629b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 11:06:26, skipping insertion in model container [2020-06-22 11:06:26,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:26,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:13" (3/5) ... [2020-06-22 11:06:26,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d629b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:26, skipping insertion in model container [2020-06-22 11:06:26,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:26,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 11:06:13" (4/5) ... [2020-06-22 11:06:26,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d629b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:26, skipping insertion in model container [2020-06-22 11:06:26,812 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 11:06:26,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:06:26" (5/5) ... [2020-06-22 11:06:26,813 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 11:06:26,833 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 11:06:26,834 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 11:06:26,834 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 11:06:26,834 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 11:06:26,834 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 11:06:26,834 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 11:06:26,834 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 11:06:26,834 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 11:06:26,834 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 11:06:26,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 11:06:26,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 11:06:26,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:26,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:26,846 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:26,846 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 11:06:26,846 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 11:06:26,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 11:06:26,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 11:06:26,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:26,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:26,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:26,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 11:06:26,853 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 17#L14true [75] L14-->L14-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[] 12#L14-2true [61] L14-2-->L17-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] 5#L17-1true [88] L17-1-->L23: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 13#L23true [105] L23-->L7-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= |v_ULTIMATE.start_cstpcpy_#in~from.base_2| v_ULTIMATE.start_cstpcpy_~from.base_8) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (= v_ULTIMATE.start_cstpcpy_~from.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_cstpcpy_~to.offset_8 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstpcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstpcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstpcpy_~to.base_9 |v_ULTIMATE.start_cstpcpy_#in~to.base_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstpcpy_#in~from.offset=|v_ULTIMATE.start_cstpcpy_#in~from.offset_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstpcpy_#res.base=|v_ULTIMATE.start_cstpcpy_#res.base_4|, ULTIMATE.start_cstpcpy_#in~to.offset=|v_ULTIMATE.start_cstpcpy_#in~to.offset_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_4|, ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstpcpy_#res.offset=|v_ULTIMATE.start_cstpcpy_#res.offset_4|, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_7, ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, ULTIMATE.start_cstpcpy_#in~from.base=|v_ULTIMATE.start_cstpcpy_#in~from.base_2|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_4|, #length=|v_#length_10|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_8, ULTIMATE.start_cstpcpy_#in~to.base=|v_ULTIMATE.start_cstpcpy_#in~to.base_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_9, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#in~from.offset, ULTIMATE.start_cstpcpy_#res.base, ULTIMATE.start_cstpcpy_#in~to.offset, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~mem2, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#res.offset, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#in~from.base, #memory_int, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_#in~to.base, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 14#L7-5true [2020-06-22 11:06:26,854 INFO L796 eck$LassoCheckResult]: Loop: 14#L7-5true [66] L7-5-->L7-1: Formula: (and (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstpcpy_~from.base_3) v_ULTIMATE.start_cstpcpy_~from.offset_3) |v_ULTIMATE.start_cstpcpy_#t~mem2_2|) (<= (+ v_ULTIMATE.start_cstpcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstpcpy_~from.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~from.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_cstpcpy_~from.base_3) 1)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_2|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 6#L7-1true [53] L7-1-->L7-2: Formula: (and (= (store |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3) v_ULTIMATE.start_cstpcpy_~to.offset_3 |v_ULTIMATE.start_cstpcpy_#t~mem2_3|)) |v_#memory_int_4|) (= (select |v_#valid_10| v_ULTIMATE.start_cstpcpy_~to.base_3) 1) (<= (+ v_ULTIMATE.start_cstpcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstpcpy_~to.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~to.offset_3)) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} AuxVars[] AssignedVars[#memory_int] 4#L7-2true [101] L7-2-->L7-4: Formula: (> |v_ULTIMATE.start_cstpcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 16#L7-4true [71] L7-4-->L7-5: Formula: (and (= v_ULTIMATE.start_cstpcpy_~from.base_6 v_ULTIMATE.start_cstpcpy_~from.base_7) (= v_ULTIMATE.start_cstpcpy_~to.base_6 v_ULTIMATE.start_cstpcpy_~to.base_7) (= v_ULTIMATE.start_cstpcpy_~to.offset_5 (+ v_ULTIMATE.start_cstpcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstpcpy_~from.offset_5 (+ v_ULTIMATE.start_cstpcpy_~from.offset_6 1))) InVars {ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_7, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_6, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_7} OutVars{ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_2|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_6, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_5, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 14#L7-5true [2020-06-22 11:06:26,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash 126047593, now seen corresponding path program 1 times [2020-06-22 11:06:26,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:26,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:26,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:26,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2943862, now seen corresponding path program 1 times [2020-06-22 11:06:26,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1102531806, now seen corresponding path program 1 times [2020-06-22 11:06:26,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:26,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:26,959 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 11:06:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 11:06:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 11:06:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 11:06:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 11:06:27,033 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 6 states. [2020-06-22 11:06:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 11:06:27,196 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-06-22 11:06:27,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 11:06:27,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 45 transitions. [2020-06-22 11:06:27,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 11:06:27,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 14 transitions. [2020-06-22 11:06:27,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 11:06:27,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 11:06:27,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-06-22 11:06:27,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:06:27,203 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 11:06:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-06-22 11:06:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 11:06:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 11:06:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 11:06:27,206 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 11:06:27,206 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 11:06:27,206 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 11:06:27,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-22 11:06:27,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 11:06:27,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 11:06:27,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 11:06:27,207 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 11:06:27,207 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 11:06:27,208 INFO L794 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 64#L14 [75] L14-->L14-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[] 66#L14-2 [76] L14-2-->L17-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[] 61#L17-1 [88] L17-1-->L23: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 62#L23 [105] L23-->L7-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= |v_ULTIMATE.start_cstpcpy_#in~from.base_2| v_ULTIMATE.start_cstpcpy_~from.base_8) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (= v_ULTIMATE.start_cstpcpy_~from.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_cstpcpy_~to.offset_8 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstpcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstpcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstpcpy_~to.base_9 |v_ULTIMATE.start_cstpcpy_#in~to.base_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstpcpy_#in~from.offset=|v_ULTIMATE.start_cstpcpy_#in~from.offset_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstpcpy_#res.base=|v_ULTIMATE.start_cstpcpy_#res.base_4|, ULTIMATE.start_cstpcpy_#in~to.offset=|v_ULTIMATE.start_cstpcpy_#in~to.offset_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_4|, ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstpcpy_#res.offset=|v_ULTIMATE.start_cstpcpy_#res.offset_4|, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_7, ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, ULTIMATE.start_cstpcpy_#in~from.base=|v_ULTIMATE.start_cstpcpy_#in~from.base_2|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_4|, #length=|v_#length_10|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_8, ULTIMATE.start_cstpcpy_#in~to.base=|v_ULTIMATE.start_cstpcpy_#in~to.base_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_9, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#in~from.offset, ULTIMATE.start_cstpcpy_#res.base, ULTIMATE.start_cstpcpy_#in~to.offset, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~mem2, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#res.offset, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#in~from.base, #memory_int, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_#in~to.base, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 67#L7-5 [2020-06-22 11:06:27,208 INFO L796 eck$LassoCheckResult]: Loop: 67#L7-5 [66] L7-5-->L7-1: Formula: (and (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstpcpy_~from.base_3) v_ULTIMATE.start_cstpcpy_~from.offset_3) |v_ULTIMATE.start_cstpcpy_#t~mem2_2|) (<= (+ v_ULTIMATE.start_cstpcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstpcpy_~from.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~from.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_cstpcpy_~from.base_3) 1)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_2|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 65#L7-1 [53] L7-1-->L7-2: Formula: (and (= (store |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3) v_ULTIMATE.start_cstpcpy_~to.offset_3 |v_ULTIMATE.start_cstpcpy_#t~mem2_3|)) |v_#memory_int_4|) (= (select |v_#valid_10| v_ULTIMATE.start_cstpcpy_~to.base_3) 1) (<= (+ v_ULTIMATE.start_cstpcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstpcpy_~to.base_3)) (<= 0 v_ULTIMATE.start_cstpcpy_~to.offset_3)) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} AuxVars[] AssignedVars[#memory_int] 59#L7-2 [101] L7-2-->L7-4: Formula: (> |v_ULTIMATE.start_cstpcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 60#L7-4 [71] L7-4-->L7-5: Formula: (and (= v_ULTIMATE.start_cstpcpy_~from.base_6 v_ULTIMATE.start_cstpcpy_~from.base_7) (= v_ULTIMATE.start_cstpcpy_~to.base_6 v_ULTIMATE.start_cstpcpy_~to.base_7) (= v_ULTIMATE.start_cstpcpy_~to.offset_5 (+ v_ULTIMATE.start_cstpcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstpcpy_~from.offset_5 (+ v_ULTIMATE.start_cstpcpy_~from.offset_6 1))) InVars {ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_7, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_6, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_7} OutVars{ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_2|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_6, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_5, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 67#L7-5 [2020-06-22 11:06:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times [2020-06-22 11:06:27,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:27,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2943862, now seen corresponding path program 2 times [2020-06-22 11:06:27,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 11:06:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:27,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1530185133, now seen corresponding path program 1 times [2020-06-22 11:06:27,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 11:06:27,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 11:06:27,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 11:06:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 11:06:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 11:06:27,537 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-06-22 11:06:27,639 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 11:06:27,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 11:06:27,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 11:06:27,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 11:06:27,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 11:06:27,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 11:06:27,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 11:06:27,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 11:06:27,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 11:06:27,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 11:06:27,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 11:06:27,658 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 11:06:27,663 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 11:06:27,665 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 11:06:27,666 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 11:06:27,669 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 11:06:27,952 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-06-22 11:06:28,083 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-06-22 11:06:28,084 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 11:06:28,087 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 11:06:28,089 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 11:06:28,090 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 11:06:28,092 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 11:06:28,093 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 11:06:28,095 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 11:06:28,096 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 11:06:28,098 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 11:06:28,100 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 11:06:28,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 11:06:28,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 11:06:28,510 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 11:06:28,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:28,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:28,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:28,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,517 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 11:06:28,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:28,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:28,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:28,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,520 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 11:06:28,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 11:06:28,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 11:06:28,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 11:06:28,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,522 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 11:06:28,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:28,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:28,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,528 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 11:06:28,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:28,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:28,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,552 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 11:06:28,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:28,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:28,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,557 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 11:06:28,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:28,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:28,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 11:06:28,562 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 11:06:28,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 11:06:28,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 11:06:28,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 11:06:28,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 11:06:28,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 11:06:28,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 11:06:28,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 11:06:28,633 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 11:06:28,634 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 11:06:28,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 11:06:28,638 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 11:06:28,638 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 11:06:28,638 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpcpy_~from.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstpcpy_~from.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 Supporting invariants [] [2020-06-22 11:06:28,676 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 11:06:28,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 11:06:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:28,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:28,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:28,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:28,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:28,767 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 11:06:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 11:06:28,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 11:06:28,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 11:06:28,866 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 11:06:28,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 11:06:28,871 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-22 11:06:28,937 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2020-06-22 11:06:28,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 11:06:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 11:06:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-06-22 11:06:28,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 11:06:28,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 11:06:28,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 11:06:28,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 11:06:28,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2020-06-22 11:06:28,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:06:28,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-06-22 11:06:28,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 11:06:28,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 11:06:28,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 11:06:28,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 11:06:28,947 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:28,948 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:28,948 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 11:06:28,948 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 11:06:28,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 11:06:28,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 11:06:28,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 11:06:28,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 11:06:28 BasicIcfg [2020-06-22 11:06:28,954 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 11:06:28,954 INFO L168 Benchmark]: Toolchain (without parser) took 15994.55 ms. Allocated memory was 514.9 MB in the beginning and 662.7 MB in the end (delta: 147.8 MB). Free memory was 439.4 MB in the beginning and 524.0 MB in the end (delta: -84.6 MB). Peak memory consumption was 63.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,955 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 11:06:28,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.10 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 438.9 MB in the beginning and 533.9 MB in the end (delta: -95.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 565.7 MB. Free memory was 533.3 MB in the beginning and 531.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,957 INFO L168 Benchmark]: Boogie Preprocessor took 26.10 ms. Allocated memory is still 565.7 MB. Free memory was 531.7 MB in the beginning and 530.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,957 INFO L168 Benchmark]: RCFGBuilder took 314.31 ms. Allocated memory is still 565.7 MB. Free memory was 530.1 MB in the beginning and 512.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,958 INFO L168 Benchmark]: BlockEncodingV2 took 111.03 ms. Allocated memory is still 565.7 MB. Free memory was 512.9 MB in the beginning and 505.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,958 INFO L168 Benchmark]: TraceAbstraction took 13040.98 ms. Allocated memory was 565.7 MB in the beginning and 630.7 MB in the end (delta: 65.0 MB). Free memory was 504.7 MB in the beginning and 456.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 50.3 GB. [2020-06-22 11:06:28,958 INFO L168 Benchmark]: BuchiAutomizer took 2148.93 ms. Allocated memory was 630.7 MB in the beginning and 662.7 MB in the end (delta: 32.0 MB). Free memory was 456.2 MB in the beginning and 524.0 MB in the end (delta: -67.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 11:06:28,962 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 22 locations, 26 edges - StatisticsResult: Encoded RCFG 15 locations, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.10 ms. Allocated memory was 514.9 MB in the beginning and 565.7 MB in the end (delta: 50.9 MB). Free memory was 438.9 MB in the beginning and 533.9 MB in the end (delta: -95.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 565.7 MB. Free memory was 533.3 MB in the beginning and 531.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.10 ms. Allocated memory is still 565.7 MB. Free memory was 531.7 MB in the beginning and 530.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 314.31 ms. Allocated memory is still 565.7 MB. Free memory was 530.1 MB in the beginning and 512.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 111.03 ms. Allocated memory is still 565.7 MB. Free memory was 512.9 MB in the beginning and 505.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13040.98 ms. Allocated memory was 565.7 MB in the beginning and 630.7 MB in the end (delta: 65.0 MB). Free memory was 504.7 MB in the beginning and 456.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2148.93 ms. Allocated memory was 630.7 MB in the beginning and 662.7 MB in the end (delta: 32.0 MB). Free memory was 456.2 MB in the beginning and 524.0 MB in the end (delta: -67.9 MB). There was no memory consumed. 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_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 - 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 #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 #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 #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 - 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 11:06:28,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 11:06:28,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 11:06:28,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 11:06:28,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 11:06:28,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && nondetArea == 0) && \valid[nondetArea] == 1) && to == 0) && 0 == from) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((from <= ULTIMATE.start_main_~nondetString~0.offset && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[from]) && 0 == unknown-#memory_int-unknown[from][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 <= length2) && nondetString == 0) && 1 <= length1) && 1 == \valid[to]) && \valid[nondetString] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && 1 == \valid[from]) && length2 <= unknown-#length-unknown[nondetArea]) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && 1 <= from) && nondetArea == 0) && from + 1 <= unknown-#length-unknown[from]) && \valid[nondetArea] == 1) && 1 <= to) && 1 <= length2) && nondetString == 0) && to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from) && 1 <= length1) && \valid[nondetString] == 1) && 1 == \valid[to]) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && length2 == unknown-#length-unknown[nondetString])) || (((((((((((((((1 <= unknown-#length-unknown[to] && length1 <= 1) && nondetArea == 0) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[from]) && 1 <= unknown-#length-unknown[nondetArea]) && to == 0) && 0 == from) && nondetString == 0) && 0 == unknown-#memory_int-unknown[from][from]) && 1 <= length1) && length2 + nondetString == 1) && \valid[nondetString] == 1) && 1 == \valid[to]) && 1 == \valid[from]) && length2 == unknown-#length-unknown[nondetString]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 12.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 395 SDslu, 267 SDs, 0 SdLazy, 711 SolverSat, 195 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 276 HoareAnnotationTreeSize, 1 FomulaSimplifications, 154 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 185 ConstructedInterpolants, 7 QuantifiedInterpolants, 17175 SizeOfPredicates, 50 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 7/55 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 * from + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 74 SDslu, 69 SDs, 0 SdLazy, 154 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp96 ukn91 mio100 lsp46 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 11:06:09.767 ----------------------------------------------- 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 11:06:29.219 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check