YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:53:38,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:53:38,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:53:38,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:53:38,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:53:38,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:53:38,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:53:38,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:53:38,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:53:38,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:53:38,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:53:38,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:53:38,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:53:38,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:53:38,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:53:38,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:53:38,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:53:38,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:53:38,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:53:38,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:53:38,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:53:38,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:53:38,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:53:38,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:53:38,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:53:38,748 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:53:38,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:53:38,749 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:53:38,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:53:38,750 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:53:38,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:53:38,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:53:38,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:53:38,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:53:38,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:53:38,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:53:38,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:53:38,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:53:38,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:53:38,755 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:53:38,769 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:53:38,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:53:38,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:53:38,770 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:53:38,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:53:38,770 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:53:38,771 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:53:38,771 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:53:38,772 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:53:38,772 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:53:38,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:53:38,772 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:53:38,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:53:38,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:53:38,773 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:53:38,773 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:53:38,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:53:38,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:53:38,773 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:53:38,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:53:38,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:53:38,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:53:38,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:53:38,774 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:53:38,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:53:38,812 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:53:38,815 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:53:38,816 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:53:38,817 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:53:38,817 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:53:38,929 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/fa171074af3f4f8e9ba05eeb2a85621d/FLAG050a529c2 [2020-06-22 10:53:39,272 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:53:39,273 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:53:39,273 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:53:39,280 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/fa171074af3f4f8e9ba05eeb2a85621d/FLAG050a529c2 [2020-06-22 10:53:39,666 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/fa171074af3f4f8e9ba05eeb2a85621d [2020-06-22 10:53:39,678 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:53:39,679 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:53:39,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:53:39,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:53:39,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:53:39,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:39,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d225ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39, skipping insertion in model container [2020-06-22 10:53:39,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:39,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:53:39,713 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:53:39,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:53:39,952 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:53:39,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:53:39,988 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:53:39,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39 WrapperNode [2020-06-22 10:53:39,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:53:39,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:53:39,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:53:39,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:53:39,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:53:40,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:53:40,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:53:40,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:53:40,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (1/1) ... [2020-06-22 10:53:40,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:53:40,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:53:40,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:53:40,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:53:40,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (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 10:53:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:53:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:53:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:53:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:53:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:53:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:53:40,368 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:53:40,368 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:53:40,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:40 BoogieIcfgContainer [2020-06-22 10:53:40,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:53:40,370 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:53:40,370 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:53:40,373 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:53:40,374 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:40" (1/1) ... [2020-06-22 10:53:40,390 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-06-22 10:53:40,392 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:53:40,393 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:53:40,393 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:53:40,394 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:53:40,396 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:53:40,396 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:53:40,397 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:53:40,416 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:53:40,441 INFO L200 BlockEncoder]: SBE split 8 edges [2020-06-22 10:53:40,446 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:53:40,447 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:53:40,477 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 10:53:40,480 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 10:53:40,483 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:53:40,484 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:53:40,484 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:53:40,485 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:53:40,485 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-06-22 10:53:40,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:53:40 BasicIcfg [2020-06-22 10:53:40,486 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:53:40,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:53:40,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:53:40,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:53:40,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:53:39" (1/4) ... [2020-06-22 10:53:40,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f84c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:53:40, skipping insertion in model container [2020-06-22 10:53:40,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (2/4) ... [2020-06-22 10:53:40,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f84c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:53:40, skipping insertion in model container [2020-06-22 10:53:40,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:40" (3/4) ... [2020-06-22 10:53:40,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f84c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:53:40, skipping insertion in model container [2020-06-22 10:53:40,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:53:40" (4/4) ... [2020-06-22 10:53:40,494 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:53:40,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:53:40,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 10:53:40,529 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 10:53:40,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:53:40,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:53:40,558 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:53:40,558 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:53:40,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:53:40,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:53:40,558 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:53:40,559 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:53:40,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:53:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-06-22 10:53:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:53:40,579 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:40,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:53:40,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 125559296, now seen corresponding path program 1 times [2020-06-22 10:53:40,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:40,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:40,748 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 10:53:40,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:40,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:53:40,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:53:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:53:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:53:40,774 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-06-22 10:53:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:40,858 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-06-22 10:53:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:53:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:53:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:40,872 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:53:40,873 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:53:40,876 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 10:53:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:53:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:53:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:53:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-06-22 10:53:40,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 [2020-06-22 10:53:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-06-22 10:53:40,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:53:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-06-22 10:53:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:53:40,914 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:40,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:53:40,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 125559298, now seen corresponding path program 1 times [2020-06-22 10:53:40,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:40,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:40,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:40,952 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 10:53:40,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:40,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:53:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:53:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:53:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:53:40,955 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2020-06-22 10:53:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,018 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2020-06-22 10:53:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:53:41,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:53:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,019 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:53:41,019 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:53:41,020 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 10:53:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:53:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:53:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:53:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-06-22 10:53:41,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 [2020-06-22 10:53:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,024 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 10:53:41,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:53:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-06-22 10:53:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:53:41,025 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:53:41,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 125559299, now seen corresponding path program 1 times [2020-06-22 10:53:41,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,058 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 10:53:41,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:53:41,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:53:41,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:53:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:53:41,059 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. [2020-06-22 10:53:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,104 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2020-06-22 10:53:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:53:41,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:53:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,105 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:53:41,105 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:53:41,105 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 10:53:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:53:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 10:53:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-06-22 10:53:41,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 [2020-06-22 10:53:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,109 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-06-22 10:53:41,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:53:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-06-22 10:53:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:53:41,110 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,110 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -402628528, now seen corresponding path program 1 times [2020-06-22 10:53:41,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,149 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 10:53:41,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:53:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:53:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:53:41,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:53:41,151 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 4 states. [2020-06-22 10:53:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,231 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-06-22 10:53:41,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:53:41,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:53:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,233 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:53:41,233 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:53:41,233 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 10:53:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:53:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2020-06-22 10:53:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:53:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2020-06-22 10:53:41,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 27 transitions. Word has length 6 [2020-06-22 10:53:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,238 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 27 transitions. [2020-06-22 10:53:41,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:53:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 27 transitions. [2020-06-22 10:53:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:53:41,239 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,239 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash -402628531, now seen corresponding path program 1 times [2020-06-22 10:53:41,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,268 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 10:53:41,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:53:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:53:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:53:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:53:41,270 INFO L87 Difference]: Start difference. First operand 14 states and 27 transitions. Second operand 3 states. [2020-06-22 10:53:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,327 INFO L93 Difference]: Finished difference Result 14 states and 27 transitions. [2020-06-22 10:53:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:53:41,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:53:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,328 INFO L225 Difference]: With dead ends: 14 [2020-06-22 10:53:41,328 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:53:41,329 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 10:53:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:53:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 10:53:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-06-22 10:53:41,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 6 [2020-06-22 10:53:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,332 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-06-22 10:53:41,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:53:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-06-22 10:53:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:53:41,333 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,333 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash -402628529, now seen corresponding path program 1 times [2020-06-22 10:53:41,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,396 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 10:53:41,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:53:41,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:53:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:53:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:53:41,398 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. [2020-06-22 10:53:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,463 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-06-22 10:53:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:53:41,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-06-22 10:53:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,465 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:53:41,465 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:53:41,465 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 10:53:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:53:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-06-22 10:53:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-06-22 10:53:41,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 6 [2020-06-22 10:53:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,469 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 10:53:41,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:53:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-06-22 10:53:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:53:41,469 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 403416315, now seen corresponding path program 1 times [2020-06-22 10:53:41,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,522 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 10:53:41,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:53:41,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:53:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:53:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:53:41,523 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 4 states. [2020-06-22 10:53:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,583 INFO L93 Difference]: Finished difference Result 13 states and 22 transitions. [2020-06-22 10:53:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:53:41,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:53:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,585 INFO L225 Difference]: With dead ends: 13 [2020-06-22 10:53:41,585 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 10:53:41,585 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 10:53:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 10:53:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 10:53:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:53:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2020-06-22 10:53:41,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 [2020-06-22 10:53:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,589 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 10:53:41,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:53:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2020-06-22 10:53:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:53:41,590 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,590 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 403416317, now seen corresponding path program 1 times [2020-06-22 10:53:41,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,625 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 10:53:41,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:53:41,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:53:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:53:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:53:41,626 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2020-06-22 10:53:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,683 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-06-22 10:53:41,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:53:41,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:53:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,684 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:53:41,684 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:53:41,685 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 10:53:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:53:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-06-22 10:53:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-06-22 10:53:41,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 7 [2020-06-22 10:53:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,688 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-06-22 10:53:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:53:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-06-22 10:53:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:53:41,689 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 403416318, now seen corresponding path program 1 times [2020-06-22 10:53:41,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,755 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 10:53:41,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:41,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:53:41,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:53:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:53:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:53:41,756 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 5 states. [2020-06-22 10:53:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:41,833 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-06-22 10:53:41,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:53:41,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 10:53:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:41,834 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:53:41,834 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:53:41,834 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 10:53:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:53:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 10:53:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-06-22 10:53:41,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 7 [2020-06-22 10:53:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:41,838 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 10:53:41,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:53:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. [2020-06-22 10:53:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:53:41,839 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:41,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:41,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash 856121391, now seen corresponding path program 1 times [2020-06-22 10:53:41,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:41,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,880 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 10:53:41,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:41,881 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 10:53:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:41,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:53:41,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:41,949 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 10:53:41,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:53:41,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:53:41,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:53:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:53:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:53:41,979 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 6 states. [2020-06-22 10:53:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:42,064 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-06-22 10:53:42,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:53:42,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 10:53:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:42,065 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:53:42,065 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:53:42,066 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 10:53:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:53:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 10:53:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-06-22 10:53:42,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 10 [2020-06-22 10:53:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:42,070 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-06-22 10:53:42,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:53:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-06-22 10:53:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:53:42,070 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:42,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:42,071 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 856121390, now seen corresponding path program 1 times [2020-06-22 10:53:42,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:42,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:42,155 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 10:53:42,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:42,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:53:42,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:53:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:53:42,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:53:42,157 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. [2020-06-22 10:53:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:42,238 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-06-22 10:53:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:53:42,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 10:53:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:42,239 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:53:42,239 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:53:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:53:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:53:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 10:53:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-06-22 10:53:42,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2020-06-22 10:53:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:42,243 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:53:42,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:53:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-06-22 10:53:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:53:42,243 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:42,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:42,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 667360179, now seen corresponding path program 1 times [2020-06-22 10:53:42,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:42,324 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 10:53:42,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:53:42,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:53:42,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:53:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:53:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:53:42,326 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 7 states. [2020-06-22 10:53:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:42,473 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2020-06-22 10:53:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:53:42,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-06-22 10:53:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:42,474 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:53:42,475 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 10:53:42,475 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 10:53:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 10:53:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 10:53:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:53:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 10:53:42,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 10 [2020-06-22 10:53:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:42,478 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:53:42,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:53:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-06-22 10:53:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:53:42,479 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:42,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:42,479 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1812859843, now seen corresponding path program 1 times [2020-06-22 10:53:42,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:42,595 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 10:53:42,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:42,596 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 10:53:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:42,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:53:42,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:42,667 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 10:53:42,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:42,676 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:42,677 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 10:53:42,678 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 10:53:42,708 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:42,708 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 10:53:42,712 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:53:42,722 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:42,727 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 10:53:42,727 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 10:53:42,771 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 10:53:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:53:42,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 10:53:42,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 10:53:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 10:53:42,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:53:42,799 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 11 states. [2020-06-22 10:53:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:43,100 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-06-22 10:53:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 10:53:43,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2020-06-22 10:53:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:43,101 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:53:43,101 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:53:43,102 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 10:53:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:53:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:53:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:53:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 10:53:43,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 [2020-06-22 10:53:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:43,106 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 10:53:43,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 10:53:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-06-22 10:53:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:53:43,106 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:43,106 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:43,106 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash 364079113, now seen corresponding path program 1 times [2020-06-22 10:53:43,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:43,147 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 10:53:43,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:43,147 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 10:53:43,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:43,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:53:43,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:43,197 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 10:53:43,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:53:43,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:53:43,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:53:43,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:53:43,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:53:43,225 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2020-06-22 10:53:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:43,295 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-06-22 10:53:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:53:43,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 10:53:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:43,296 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:53:43,296 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:53:43,296 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 10:53:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:53:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:53:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:53:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 10:53:43,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2020-06-22 10:53:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:43,300 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 10:53:43,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:53:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-06-22 10:53:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:53:43,300 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:43,300 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:43,301 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 364079114, now seen corresponding path program 1 times [2020-06-22 10:53:43,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:43,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:43,367 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 10:53:43,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:43,368 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 10:53:43,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:43,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 10:53:43,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:43,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:53:43,416 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 10:53:43,416 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:43,430 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:43,439 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 10:53:43,440 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:43,456 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:43,457 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 10:53:43,457 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-06-22 10:53:43,556 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 10:53:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:53:43,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-06-22 10:53:43,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 10:53:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 10:53:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:53:43,583 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 11 states. [2020-06-22 10:53:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:49,762 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 10:53:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:53:49,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-06-22 10:53:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:49,763 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:53:49,763 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:53:49,764 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 10:53:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:53:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-06-22 10:53:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:53:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-06-22 10:53:49,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2020-06-22 10:53:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:49,767 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 10:53:49,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 10:53:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-06-22 10:53:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 10:53:49,768 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:49,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:49,769 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548834, now seen corresponding path program 2 times [2020-06-22 10:53:49,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:49,929 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 10:53:49,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:49,929 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 10:53:49,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:53:49,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:53:49,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:53:49,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 10:53:49,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:49,978 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 10:53:49,979 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:49,984 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:49,988 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 10:53:49,988 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:49,996 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:49,996 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 10:53:49,996 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 10:53:50,014 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 10:53:50,015 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,022 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 10:53:50,022 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-06-22 10:53:50,050 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 10:53:50,050 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,059 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,059 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 10:53:50,060 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:23 [2020-06-22 10:53:50,091 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,092 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 10:53:50,093 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:53:50,104 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,106 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 10:53:50,106 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 10:53:50,155 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 10:53:50,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:53:50,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-06-22 10:53:50,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-06-22 10:53:50,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-06-22 10:53:50,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-06-22 10:53:50,182 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 13 states. [2020-06-22 10:53:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:50,716 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-06-22 10:53:50,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 10:53:50,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-06-22 10:53:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:50,718 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:53:50,718 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:53:50,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-06-22 10:53:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:53:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2020-06-22 10:53:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:53:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-06-22 10:53:50,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2020-06-22 10:53:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 10:53:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-06-22 10:53:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-06-22 10:53:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:53:50,724 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:53:50,724 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:53:50,724 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 10:53:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1393404990, now seen corresponding path program 1 times [2020-06-22 10:53:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:50,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:53:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 10:53:50,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:53:50,829 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 10:53:50,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:50,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 10:53:50,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:50,880 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 10:53:50,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,887 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,889 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 10:53:50,890 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,897 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,898 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 10:53:50,898 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 10:53:50,903 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 10:53:50,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,908 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,909 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,909 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 10:53:50,914 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 10:53:50,915 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,921 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,921 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 10:53:50,921 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 10:53:50,927 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 10:53:50,928 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,934 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 10:53:50,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 10:53:50,952 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,952 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 10:53:50,953 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:53:50,959 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:53:50,960 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:53:50,960 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 10:53:50,990 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 10:53:51,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:53:51,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-06-22 10:53:51,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-06-22 10:53:51,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 10:53:51,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:53:51,018 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 10 states. [2020-06-22 10:53:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:53:51,141 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-06-22 10:53:51,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:53:51,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-06-22 10:53:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:53:51,142 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:53:51,143 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:53:51,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-06-22 10:53:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:53:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:53:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:53:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:53:51,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-06-22 10:53:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:53:51,144 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:53:51,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-06-22 10:53:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:53:51,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:53:51,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:53:51,580 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 14 29) no Hoare annotation was computed. [2020-06-22 10:53:51,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 14 29) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,585 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-06-22 10:53:51,586 INFO L444 ceAbstractionStarter]: At program point L10-5(line 10) the Hoare annotation is: (let ((.cse3 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (.cse12 (select |#memory_int| ULTIMATE.start_cstrcpy_~from.base)) (.cse9 (select |#length| ULTIMATE.start_cstrcpy_~from.base))) (let ((.cse14 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse0 (select |#length| ULTIMATE.start_cstrcpy_~to.base)) (.cse1 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse2 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse15 (not (= ULTIMATE.start_cstrcpy_~to.base ULTIMATE.start_cstrcpy_~from.base))) (.cse16 (= (select .cse12 (+ .cse9 (- 1))) 0)) (.cse4 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~to.base))) (.cse17 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse5 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse6 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (= ULTIMATE.start_cstrcpy_~from.offset 0)) (.cse8 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse18 (<= ULTIMATE.start_main_~length2~0 .cse3)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~from.base))) (.cse10 (= 0 ULTIMATE.start_cstrcpy_~to.offset)) (.cse19 (<= (+ ULTIMATE.start_cstrcpy_~from.offset 1) .cse9)) (.cse13 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and (<= 1 .cse0) .cse1 .cse2 (<= 1 .cse3) .cse4 .cse5 .cse6 .cse7 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse8 (<= 1 .cse9) .cse10 .cse11 (= 0 (select .cse12 ULTIMATE.start_cstrcpy_~from.offset)) .cse13) (and .cse14 .cse1 .cse2 .cse15 (<= 1 ULTIMATE.start_cstrcpy_~to.offset) (<= (+ .cse9 ULTIMATE.start_cstrcpy_~to.offset) (+ ULTIMATE.start_cstrcpy_~from.offset .cse0)) .cse16 .cse4 .cse17 .cse5 (<= 1 ULTIMATE.start_cstrcpy_~from.offset) .cse6 .cse8 .cse18 .cse11 .cse19 .cse13) (and .cse14 (<= .cse9 .cse0) .cse1 .cse2 .cse15 .cse16 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18 .cse11 .cse10 .cse19 .cse13)))) [2020-06-22 10:53:51,586 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:53:51,599 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,600 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,616 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:51,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:51,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:53:51 BasicIcfg [2020-06-22 10:53:51,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:53:51,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:53:51,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:53:51,628 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:53:51,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:53:51,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:53:39" (1/5) ... [2020-06-22 10:53:51,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec3427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:53:51, skipping insertion in model container [2020-06-22 10:53:51,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:53:51,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:53:39" (2/5) ... [2020-06-22 10:53:51,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec3427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:53:51, skipping insertion in model container [2020-06-22 10:53:51,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:53:51,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:53:40" (3/5) ... [2020-06-22 10:53:51,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec3427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:53:51, skipping insertion in model container [2020-06-22 10:53:51,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:53:51,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:53:40" (4/5) ... [2020-06-22 10:53:51,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ec3427c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:53:51, skipping insertion in model container [2020-06-22 10:53:51,631 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:53:51,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:53:51" (5/5) ... [2020-06-22 10:53:51,632 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:53:51,654 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:53:51,654 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:53:51,654 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:53:51,654 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:53:51,654 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:53:51,654 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:53:51,654 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:53:51,655 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:53:51,655 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:53:51,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 10:53:51,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:53:51,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:53:51,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:53:51,667 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:53:51,667 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:53:51,667 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:53:51,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 10:53:51,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 10:53:51,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:53:51,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:53:51,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:53:51,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:53:51,674 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L17: 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] 9#L17true [75] L17-->L17-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[] 3#L17-2true [76] L17-2-->L20-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[] 12#L20-1true [88] L20-1-->L26: 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|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= |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] 5#L26true [105] L26-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (<= 1 .cse0) (= v_ULTIMATE.start_cstrcpy_~save~0.base_4 v_ULTIMATE.start_cstrcpy_~to.base_8) (= v_ULTIMATE.start_cstrcpy_~from.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_cstrcpy_~from.offset_7) (= v_ULTIMATE.start_cstrcpy_~save~0.offset_4 v_ULTIMATE.start_cstrcpy_~to.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstrcpy_~to.offset_7 |v_ULTIMATE.start_cstrcpy_#in~to.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~from.base_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_cstrcpy_#in~from.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= |v_ULTIMATE.start_cstrcpy_#in~to.base_2| v_ULTIMATE.start_cstrcpy_~to.base_8) (= |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_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_8, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_4|, ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_4|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_8, ULTIMATE.start_cstrcpy_#in~to.base=|v_ULTIMATE.start_cstrcpy_#in~to.base_2|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_~save~0.offset=v_ULTIMATE.start_cstrcpy_~save~0.offset_4, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_7, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#in~from.offset=|v_ULTIMATE.start_cstrcpy_#in~from.offset_2|, ULTIMATE.start_cstrcpy_#in~to.offset=|v_ULTIMATE.start_cstrcpy_#in~to.offset_2|, ULTIMATE.start_cstrcpy_#in~from.base=|v_ULTIMATE.start_cstrcpy_#in~from.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_4|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_~save~0.base=v_ULTIMATE.start_cstrcpy_~save~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_~save~0.offset, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_#t~pre0.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#in~from.offset, ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_#in~to.offset, ULTIMATE.start_cstrcpy_#in~from.base, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#in~to.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, #memory_int, ULTIMATE.start_cstrcpy_~save~0.base] 6#L10-5true [2020-06-22 10:53:51,675 INFO L796 eck$LassoCheckResult]: Loop: 6#L10-5true [54] L10-5-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_cstrcpy_~from.base_3) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrcpy_~from.base_3) v_ULTIMATE.start_cstrcpy_~from.offset_3)) (<= 0 v_ULTIMATE.start_cstrcpy_~from.offset_3) (<= (+ v_ULTIMATE.start_cstrcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstrcpy_~from.base_3))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_3, #length=|v_#length_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 13#L10-1true [66] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_cstrcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcpy_~to.base_3)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrcpy_~to.base_3)) (= |v_#memory_int_4| (store |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstrcpy_~to.base_3) v_ULTIMATE.start_cstrcpy_~to.offset_3 |v_ULTIMATE.start_cstrcpy_#t~mem2_3|))) (<= 0 v_ULTIMATE.start_cstrcpy_~to.offset_3)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_3, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 11#L10-2true [101] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 8#L10-4true [58] L10-4-->L10-5: Formula: (and (= v_ULTIMATE.start_cstrcpy_~from.offset_5 (+ v_ULTIMATE.start_cstrcpy_~from.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~to.base_6 v_ULTIMATE.start_cstrcpy_~to.base_7) (= v_ULTIMATE.start_cstrcpy_~to.offset_5 (+ v_ULTIMATE.start_cstrcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstrcpy_~from.base_6 v_ULTIMATE.start_cstrcpy_~from.base_7)) InVars {ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_7, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_7, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_6, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_6} OutVars{ULTIMATE.start_cstrcpy_#t~pre0.offset=|v_ULTIMATE.start_cstrcpy_#t~pre0.offset_2|, ULTIMATE.start_cstrcpy_~to.base=v_ULTIMATE.start_cstrcpy_~to.base_6, ULTIMATE.start_cstrcpy_~to.offset=v_ULTIMATE.start_cstrcpy_~to.offset_5, ULTIMATE.start_cstrcpy_~from.offset=v_ULTIMATE.start_cstrcpy_~from.offset_5, ULTIMATE.start_cstrcpy_#t~pre1.base=|v_ULTIMATE.start_cstrcpy_#t~pre1.base_2|, ULTIMATE.start_cstrcpy_#t~pre1.offset=|v_ULTIMATE.start_cstrcpy_#t~pre1.offset_2|, ULTIMATE.start_cstrcpy_~from.base=v_ULTIMATE.start_cstrcpy_~from.base_6, ULTIMATE.start_cstrcpy_#t~pre0.base=|v_ULTIMATE.start_cstrcpy_#t~pre0.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~pre0.offset, ULTIMATE.start_cstrcpy_~to.base, ULTIMATE.start_cstrcpy_~to.offset, ULTIMATE.start_cstrcpy_~from.offset, ULTIMATE.start_cstrcpy_#t~pre1.base, ULTIMATE.start_cstrcpy_#t~pre1.offset, ULTIMATE.start_cstrcpy_~from.base, ULTIMATE.start_cstrcpy_#t~pre0.base] 6#L10-5true [2020-06-22 10:53:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times [2020-06-22 10:53:51,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:51,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:51,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2598850, now seen corresponding path program 1 times [2020-06-22 10:53:51,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:51,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:51,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:51,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1529840121, now seen corresponding path program 1 times [2020-06-22 10:53:51,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:53:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:53:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:53:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:53:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:53:52,005 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2020-06-22 10:53:52,104 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:53:52,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:53:52,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:53:52,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:53:52,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:53:52,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:53:52,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:53:52,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:53:52,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:53:52,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:53:52,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:53:52,133 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 10:53:52,138 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 10:53:52,141 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 10:53:52,143 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 10:53:52,145 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 10:53:52,149 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 10:53:52,151 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 10:53:52,442 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-06-22 10:53:52,596 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-06-22 10:53:52,597 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 10:53:52,599 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 10:53:52,601 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 10:53:52,603 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 10:53:52,604 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 10:53:52,606 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 10:53:52,608 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 10:53:52,610 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 10:53:52,993 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:53:52,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:53:53,000 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 10:53:53,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,008 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 10:53:53,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,010 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 10:53:53,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,013 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 10:53:53,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,015 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 10:53:53,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,018 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 10:53:53,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,020 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 10:53:53,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,037 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 10:53:53,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,040 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 10:53:53,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:53:53,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:53:53,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:53:53,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,043 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 10:53:53,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,048 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 10:53:53,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,053 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 10:53:53,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,063 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 10:53:53,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,068 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 10:53:53,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:53:53,080 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 10:53:53,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:53:53,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:53:53,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:53:53,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:53:53,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:53:53,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:53:53,131 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:53:53,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:53:53,151 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:53:53,154 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:53:53,155 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:53:53,155 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:53:53,156 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcpy_~from.base)_1, ULTIMATE.start_cstrcpy_~from.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcpy_~from.base)_1 - 1*ULTIMATE.start_cstrcpy_~from.offset Supporting invariants [] [2020-06-22 10:53:53,195 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 10:53:53,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:53:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:53,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:53:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:53,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:53:53,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:53,264 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 10:53:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:53:53,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:53:53,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:53:53,325 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:53:53,329 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:53:53,330 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 3 states. [2020-06-22 10:53:53,418 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 3 states. Result 23 states and 49 transitions. Complement of second has 6 states. [2020-06-22 10:53:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:53:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:53:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-06-22 10:53:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 10:53:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:53:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 10:53:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:53:53,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 10:53:53,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:53:53,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 49 transitions. [2020-06-22 10:53:53,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:53:53,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2020-06-22 10:53:53,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:53:53,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:53:53,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:53:53,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:53:53,433 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:53:53,433 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:53:53,434 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:53:53,434 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:53:53,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:53:53,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:53:53,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:53:53,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:53:53 BasicIcfg [2020-06-22 10:53:53,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:53:53,440 INFO L168 Benchmark]: Toolchain (without parser) took 13762.28 ms. Allocated memory was 649.6 MB in the beginning and 837.8 MB in the end (delta: 188.2 MB). Free memory was 559.6 MB in the beginning and 617.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 130.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,441 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:53:53,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.93 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 558.5 MB in the beginning and 634.7 MB in the end (delta: -76.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.11 ms. Allocated memory is still 670.6 MB. Free memory was 634.7 MB in the beginning and 633.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,443 INFO L168 Benchmark]: Boogie Preprocessor took 25.91 ms. Allocated memory is still 670.6 MB. Free memory was 633.6 MB in the beginning and 631.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,443 INFO L168 Benchmark]: RCFGBuilder took 310.66 ms. Allocated memory is still 670.6 MB. Free memory was 631.4 MB in the beginning and 610.0 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,443 INFO L168 Benchmark]: BlockEncodingV2 took 115.61 ms. Allocated memory is still 670.6 MB. Free memory was 610.0 MB in the beginning and 602.4 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,444 INFO L168 Benchmark]: TraceAbstraction took 11137.12 ms. Allocated memory was 670.6 MB in the beginning and 762.8 MB in the end (delta: 92.3 MB). Free memory was 602.4 MB in the beginning and 535.3 MB in the end (delta: 67.1 MB). Peak memory consumption was 159.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:53:53,444 INFO L168 Benchmark]: BuchiAutomizer took 1815.63 ms. Allocated memory was 762.8 MB in the beginning and 837.8 MB in the end (delta: 75.0 MB). Free memory was 535.3 MB in the beginning and 617.4 MB in the end (delta: -82.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:53:53,449 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.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.93 ms. Allocated memory was 649.6 MB in the beginning and 670.6 MB in the end (delta: 21.0 MB). Free memory was 558.5 MB in the beginning and 634.7 MB in the end (delta: -76.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.11 ms. Allocated memory is still 670.6 MB. Free memory was 634.7 MB in the beginning and 633.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.91 ms. Allocated memory is still 670.6 MB. Free memory was 633.6 MB in the beginning and 631.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 310.66 ms. Allocated memory is still 670.6 MB. Free memory was 631.4 MB in the beginning and 610.0 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 115.61 ms. Allocated memory is still 670.6 MB. Free memory was 610.0 MB in the beginning and 602.4 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 11137.12 ms. Allocated memory was 670.6 MB in the beginning and 762.8 MB in the end (delta: 92.3 MB). Free memory was 602.4 MB in the beginning and 535.3 MB in the end (delta: 67.1 MB). Peak memory consumption was 159.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1815.63 ms. Allocated memory was 762.8 MB in the beginning and 837.8 MB in the end (delta: 75.0 MB). Free memory was 535.3 MB in the beginning and 617.4 MB in the end (delta: -82.2 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 #length - 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: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: 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: 10]: Loop Invariant [2020-06-22 10:53:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,461 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:53:53,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:53:53,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((1 <= unknown-#length-unknown[to] && nondetArea == 0) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[to]) && nondetString == 0) && 1 <= length1) && from == 0) && length2 + nondetString == 1) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[from]) && 0 == to) && 1 == \valid[from]) && 0 == unknown-#memory_int-unknown[from][from]) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(nondetString == nondetArea) && nondetArea == 0) && \valid[nondetArea] == 1) && !(to == from)) && 1 <= to) && unknown-#length-unknown[from] + to <= from + unknown-#length-unknown[to]) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1] == 0) && 1 == \valid[to]) && 1 <= length2) && nondetString == 0) && 1 <= from) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && from + 1 <= unknown-#length-unknown[from]) && length2 == unknown-#length-unknown[nondetString])) || ((((((((((((((((!(nondetString == nondetArea) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && nondetArea == 0) && \valid[nondetArea] == 1) && !(to == from)) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1] == 0) && 1 == \valid[to]) && 1 <= length2) && nondetString == 0) && 1 <= length1) && from == 0) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && 1 == \valid[from]) && 0 == to) && from + 1 <= unknown-#length-unknown[from]) && length2 == unknown-#length-unknown[nondetString]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 11.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 SDtfs, 415 SDslu, 292 SDs, 0 SdLazy, 789 SolverSat, 187 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=16, 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, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 237 HoareAnnotationTreeSize, 1 FomulaSimplifications, 94 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 244 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 199 ConstructedInterpolants, 7 QuantifiedInterpolants, 17467 SizeOfPredicates, 50 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 11/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[from] + -1 * from and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 7 SDtfs, 46 SDslu, 10 SDs, 0 SdLazy, 63 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax100 hnf100 lsp96 ukn90 mio100 lsp45 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 6 VariablesLoop: 3 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 10:53:36.402 ----------------------------------------------- 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 10:53:53.698 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check