YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:56:11,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:56:11,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:56:11,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:56:11,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:56:11,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:56:11,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:56:11,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:56:11,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:56:11,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:56:11,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:56:11,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:56:11,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:56:11,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:56:11,818 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:56:11,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:56:11,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:56:11,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:56:11,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:56:11,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:56:11,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:56:11,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:56:11,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:56:11,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:56:11,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:56:11,830 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:56:11,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:56:11,831 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:56:11,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:56:11,832 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:56:11,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:56:11,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:56:11,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:56:11,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:56:11,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:56:11,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:56:11,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:56:11,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:56:11,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:56:11,837 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 08:56:11,852 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:56:11,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:56:11,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:56:11,853 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:56:11,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:56:11,854 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:56:11,854 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:56:11,854 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:56:11,854 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:56:11,854 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:56:11,855 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:56:11,855 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:56:11,855 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:56:11,855 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:56:11,855 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:56:11,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:56:11,856 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:56:11,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:56:11,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:56:11,856 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:56:11,856 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:56:11,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:56:11,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:56:11,857 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:56:11,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:56:11,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:56:11,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:56:11,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:56:11,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:56:11,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:56:11,898 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:56:11,901 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:56:11,903 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:56:11,903 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:56:11,904 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:56:11,968 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/5321cc60a67e4becae7d2aba2e758e35/FLAG6d3f6f507 [2020-06-22 08:56:12,315 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:56:12,316 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 08:56:12,316 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:56:12,323 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/5321cc60a67e4becae7d2aba2e758e35/FLAG6d3f6f507 [2020-06-22 08:56:12,715 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/5321cc60a67e4becae7d2aba2e758e35 [2020-06-22 08:56:12,726 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:56:12,728 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:56:12,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:56:12,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:56:12,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:56:12,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:56:12" (1/1) ... [2020-06-22 08:56:12,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735fbf4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:12, skipping insertion in model container [2020-06-22 08:56:12,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:56:12" (1/1) ... [2020-06-22 08:56:12,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:56:12,763 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:56:12,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:56:12,992 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:56:13,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:56:13,026 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:56:13,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13 WrapperNode [2020-06-22 08:56:13,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:56:13,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:56:13,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:56:13,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:56:13,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:56:13,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:56:13,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:56:13,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:56:13,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:56:13,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:56:13,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:56:13,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:56:13,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:56:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:56:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:56:13,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:56:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:56:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:56:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:56:13,401 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:56:13,401 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 08:56:13,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:56:13 BoogieIcfgContainer [2020-06-22 08:56:13,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:56:13,403 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:56:13,404 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:56:13,406 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:56:13,407 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:56:13" (1/1) ... [2020-06-22 08:56:13,424 INFO L313 BlockEncoder]: Initial Icfg 31 locations, 38 edges [2020-06-22 08:56:13,426 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:56:13,427 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:56:13,427 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:56:13,427 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:56:13,429 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:56:13,430 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:56:13,430 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:56:13,451 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:56:13,481 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 08:56:13,486 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 08:56:13,487 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:56:13,516 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 08:56:13,518 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 08:56:13,520 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:56:13,520 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:56:13,521 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:56:13,521 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:56:13,522 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 41 edges [2020-06-22 08:56:13,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:56:13 BasicIcfg [2020-06-22 08:56:13,522 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:56:13,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:56:13,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:56:13,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:56:13,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:56:12" (1/4) ... [2020-06-22 08:56:13,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:56:13, skipping insertion in model container [2020-06-22 08:56:13,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (2/4) ... [2020-06-22 08:56:13,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:56:13, skipping insertion in model container [2020-06-22 08:56:13,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:56:13" (3/4) ... [2020-06-22 08:56:13,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:56:13, skipping insertion in model container [2020-06-22 08:56:13,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:56:13" (4/4) ... [2020-06-22 08:56:13,530 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:56:13,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:56:13,548 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 08:56:13,565 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 08:56:13,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:56:13,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:56:13,595 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:56:13,595 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:56:13,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:56:13,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:56:13,595 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:56:13,595 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:56:13,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:56:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-06-22 08:56:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:56:13,617 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:13,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:56:13,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash 175224190, now seen corresponding path program 1 times [2020-06-22 08:56:13,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:13,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:13,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:13,786 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 08:56:13,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:13,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:56:13,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:56:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:56:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:56:13,809 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-06-22 08:56:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:13,922 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2020-06-22 08:56:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:56:13,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:56:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:13,939 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:56:13,939 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 08:56:13,942 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 08:56:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 08:56:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:56:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:56:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2020-06-22 08:56:13,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 5 [2020-06-22 08:56:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:13,981 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 39 transitions. [2020-06-22 08:56:13,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:56:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. [2020-06-22 08:56:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:56:13,982 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:13,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:56:13,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 175224192, now seen corresponding path program 1 times [2020-06-22 08:56:13,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:13,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:13,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:13,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,021 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 08:56:14,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:56:14,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:56:14,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:56:14,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:14,024 INFO L87 Difference]: Start difference. First operand 22 states and 39 transitions. Second operand 4 states. [2020-06-22 08:56:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:14,107 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2020-06-22 08:56:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:14,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 08:56:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:14,108 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:56:14,109 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 08:56:14,110 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 08:56:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 08:56:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:56:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:56:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2020-06-22 08:56:14,114 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 5 [2020-06-22 08:56:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:14,115 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 38 transitions. [2020-06-22 08:56:14,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:56:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 38 transitions. [2020-06-22 08:56:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:56:14,115 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:14,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:56:14,116 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash 175224193, now seen corresponding path program 1 times [2020-06-22 08:56:14,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:14,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,151 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 08:56:14,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:56:14,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:56:14,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:56:14,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:56:14,154 INFO L87 Difference]: Start difference. First operand 22 states and 38 transitions. Second operand 3 states. [2020-06-22 08:56:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:14,214 INFO L93 Difference]: Finished difference Result 22 states and 38 transitions. [2020-06-22 08:56:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:56:14,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:56:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:14,215 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:56:14,215 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 08:56:14,216 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 08:56:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 08:56:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 08:56:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:56:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 37 transitions. [2020-06-22 08:56:14,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 37 transitions. Word has length 5 [2020-06-22 08:56:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:14,220 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 37 transitions. [2020-06-22 08:56:14,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:56:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 37 transitions. [2020-06-22 08:56:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:56:14,221 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:14,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:14,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1719456963, now seen corresponding path program 1 times [2020-06-22 08:56:14,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:14,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,283 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 08:56:14,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:14,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:56:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:14,293 INFO L87 Difference]: Start difference. First operand 21 states and 37 transitions. Second operand 5 states. [2020-06-22 08:56:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:14,387 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2020-06-22 08:56:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:56:14,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 08:56:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:14,389 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:56:14,389 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:56:14,389 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 08:56:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:56:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:56:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:56:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 08:56:14,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 8 [2020-06-22 08:56:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:14,394 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 08:56:14,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:56:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-06-22 08:56:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:56:14,394 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:14,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:14,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1719456965, now seen corresponding path program 1 times [2020-06-22 08:56:14,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:14,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:14,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:14,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,487 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 08:56:14,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:56:14,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:56:14,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:56:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:56:14,489 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 7 states. [2020-06-22 08:56:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:14,696 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. [2020-06-22 08:56:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:56:14,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 08:56:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:14,698 INFO L225 Difference]: With dead ends: 27 [2020-06-22 08:56:14,698 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:56:14,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 08:56:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:56:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2020-06-22 08:56:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:56:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-06-22 08:56:14,704 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 8 [2020-06-22 08:56:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:14,704 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-06-22 08:56:14,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:56:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-06-22 08:56:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:56:14,705 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:14,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:14,706 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:14,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:14,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557298, now seen corresponding path program 1 times [2020-06-22 08:56:14,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:14,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:14,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:14,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,763 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 08:56:14,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:56:14,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:56:14,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:56:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:56:14,765 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 6 states. [2020-06-22 08:56:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:14,887 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2020-06-22 08:56:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:56:14,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-06-22 08:56:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:14,889 INFO L225 Difference]: With dead ends: 27 [2020-06-22 08:56:14,889 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:56:14,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:56:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:56:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-06-22 08:56:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 08:56:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2020-06-22 08:56:14,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 9 [2020-06-22 08:56:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:14,895 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 41 transitions. [2020-06-22 08:56:14,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:56:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 41 transitions. [2020-06-22 08:56:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:56:14,895 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:14,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:14,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557295, now seen corresponding path program 1 times [2020-06-22 08:56:14,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:14,964 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 08:56:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:56:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:56:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:56:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:56:14,966 INFO L87 Difference]: Start difference. First operand 23 states and 41 transitions. Second operand 6 states. [2020-06-22 08:56:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:15,073 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2020-06-22 08:56:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:56:15,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-06-22 08:56:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:15,074 INFO L225 Difference]: With dead ends: 23 [2020-06-22 08:56:15,075 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 08:56:15,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:56:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 08:56:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:56:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:56:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-06-22 08:56:15,079 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 9 [2020-06-22 08:56:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:15,080 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-06-22 08:56:15,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:56:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-06-22 08:56:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:56:15,080 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:15,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:15,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:15,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1763557297, now seen corresponding path program 1 times [2020-06-22 08:56:15,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:15,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:15,162 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 08:56:15,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:56:15,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:56:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:56:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:56:15,163 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 7 states. [2020-06-22 08:56:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:15,307 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2020-06-22 08:56:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:56:15,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-06-22 08:56:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:15,309 INFO L225 Difference]: With dead ends: 24 [2020-06-22 08:56:15,309 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 08:56:15,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 08:56:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 08:56:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-06-22 08:56:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:56:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2020-06-22 08:56:15,314 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 [2020-06-22 08:56:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:15,314 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 36 transitions. [2020-06-22 08:56:15,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:56:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 36 transitions. [2020-06-22 08:56:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:56:15,315 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:15,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:15,315 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:15,315 INFO L82 PathProgramCache]: Analyzing trace with hash 492655594, now seen corresponding path program 1 times [2020-06-22 08:56:15,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:15,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:15,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:15,360 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 08:56:15,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:15,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:15,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:56:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:15,361 INFO L87 Difference]: Start difference. First operand 22 states and 36 transitions. Second operand 5 states. [2020-06-22 08:56:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:15,464 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. [2020-06-22 08:56:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:56:15,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-06-22 08:56:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:15,465 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:56:15,465 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 08:56:15,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:56:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 08:56:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 08:56:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 08:56:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2020-06-22 08:56:15,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 13 [2020-06-22 08:56:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:15,470 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2020-06-22 08:56:15,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:56:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-06-22 08:56:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:56:15,471 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:15,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:15,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash 492655596, now seen corresponding path program 1 times [2020-06-22 08:56:15,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:15,571 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 08:56:15,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:15,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 08:56:15,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:56:15,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:56:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:56:15,572 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 9 states. [2020-06-22 08:56:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:15,824 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. [2020-06-22 08:56:15,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 08:56:15,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-06-22 08:56:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:15,826 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:56:15,826 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:56:15,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:56:15,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:56:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2020-06-22 08:56:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:56:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2020-06-22 08:56:15,831 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 13 [2020-06-22 08:56:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:15,831 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2020-06-22 08:56:15,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:56:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2020-06-22 08:56:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:56:15,832 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:15,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:15,832 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 492655597, now seen corresponding path program 1 times [2020-06-22 08:56:15,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:15,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:15,898 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 08:56:15,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 08:56:15,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 08:56:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:56:15,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:56:15,900 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand 8 states. [2020-06-22 08:56:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:16,054 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-06-22 08:56:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:56:16,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-06-22 08:56:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:16,055 INFO L225 Difference]: With dead ends: 26 [2020-06-22 08:56:16,056 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 08:56:16,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-06-22 08:56:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 08:56:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 08:56:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:56:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-06-22 08:56:16,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 13 [2020-06-22 08:56:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:16,061 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-06-22 08:56:16,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 08:56:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-06-22 08:56:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:56:16,061 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:16,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:16,062 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 492655627, now seen corresponding path program 1 times [2020-06-22 08:56:16,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:16,098 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 08:56:16,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:16,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:16,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:56:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:56:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:16,099 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2020-06-22 08:56:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:16,158 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2020-06-22 08:56:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:16,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 08:56:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:16,159 INFO L225 Difference]: With dead ends: 36 [2020-06-22 08:56:16,159 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 08:56:16,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 08:56:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-06-22 08:56:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 08:56:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-06-22 08:56:16,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2020-06-22 08:56:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:16,165 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-06-22 08:56:16,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:56:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-06-22 08:56:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 08:56:16,166 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:16,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:16,166 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2059501334, now seen corresponding path program 1 times [2020-06-22 08:56:16,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:16,200 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 08:56:16,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:16,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:16,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:56:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:56:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:16,201 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. [2020-06-22 08:56:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:16,251 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-06-22 08:56:16,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:16,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-06-22 08:56:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:16,252 INFO L225 Difference]: With dead ends: 45 [2020-06-22 08:56:16,252 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 08:56:16,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 08:56:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-06-22 08:56:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:56:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2020-06-22 08:56:16,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 13 [2020-06-22 08:56:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:16,257 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2020-06-22 08:56:16,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:56:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2020-06-22 08:56:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 08:56:16,258 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:16,258 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:16,258 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1859314095, now seen corresponding path program 1 times [2020-06-22 08:56:16,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:16,409 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 08:56:16,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:16,410 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 08:56:16,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:16,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 08:56:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:16,519 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 08:56:16,520 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:16,530 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:16,531 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 08:56:16,531 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 08:56:16,638 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:16,639 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 08:56:16,643 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:56:16,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:16,666 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:56:16,666 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2020-06-22 08:56:16,713 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 08:56:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:16,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2020-06-22 08:56:16,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 08:56:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 08:56:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:56:16,743 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 14 states. [2020-06-22 08:56:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:17,453 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-06-22 08:56:17,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 08:56:17,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-06-22 08:56:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:17,454 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:56:17,454 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:56:17,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-06-22 08:56:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:56:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-06-22 08:56:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:56:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2020-06-22 08:56:17,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 14 [2020-06-22 08:56:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:17,460 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2020-06-22 08:56:17,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 08:56:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2020-06-22 08:56:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 08:56:17,461 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:17,461 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:17,461 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1859314094, now seen corresponding path program 1 times [2020-06-22 08:56:17,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:17,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,519 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 08:56:17,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:17,520 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 08:56:17,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:56:17,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:17,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:17,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-06-22 08:56:17,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:56:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:56:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:56:17,600 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 9 states. [2020-06-22 08:56:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:17,750 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2020-06-22 08:56:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:56:17,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-06-22 08:56:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:17,751 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:56:17,751 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:56:17,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:56:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:56:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 08:56:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:56:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-06-22 08:56:17,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 14 [2020-06-22 08:56:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:17,757 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-06-22 08:56:17,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:56:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-06-22 08:56:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:56:17,758 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:17,758 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:17,758 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1804163162, now seen corresponding path program 1 times [2020-06-22 08:56:17,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:17,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:17,834 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 08:56:17,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:17,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:56:17,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:17,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-06-22 08:56:17,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:56:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:56:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:56:17,917 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 9 states. [2020-06-22 08:56:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:18,057 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-06-22 08:56:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:56:18,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-06-22 08:56:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:18,059 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:56:18,059 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:56:18,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:56:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:56:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 08:56:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:56:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2020-06-22 08:56:18,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2020-06-22 08:56:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:18,064 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2020-06-22 08:56:18,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:56:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-06-22 08:56:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:56:18,065 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:18,065 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:18,066 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1804163163, now seen corresponding path program 1 times [2020-06-22 08:56:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:18,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:18,176 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 08:56:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:18,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 08:56:18,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:18,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:56:18,229 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 08:56:18,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:18,240 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:18,241 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:18,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 [2020-06-22 08:56:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:18,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-06-22 08:56:18,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:56:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:56:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:56:18,437 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 17 states. [2020-06-22 08:56:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:19,212 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-06-22 08:56:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 08:56:19,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-06-22 08:56:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:19,213 INFO L225 Difference]: With dead ends: 62 [2020-06-22 08:56:19,213 INFO L226 Difference]: Without dead ends: 61 [2020-06-22 08:56:19,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2020-06-22 08:56:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-06-22 08:56:19,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2020-06-22 08:56:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:56:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-06-22 08:56:19,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2020-06-22 08:56:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:19,220 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-06-22 08:56:19,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:56:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2020-06-22 08:56:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:56:19,220 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:19,221 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:19,221 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1804133372, now seen corresponding path program 1 times [2020-06-22 08:56:19,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:19,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:19,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:19,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:19,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:19,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:19,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:19,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:56:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:56:19,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:19,252 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand 4 states. [2020-06-22 08:56:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:19,300 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-06-22 08:56:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:19,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-06-22 08:56:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:19,316 INFO L225 Difference]: With dead ends: 44 [2020-06-22 08:56:19,316 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:56:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:56:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:56:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:56:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-06-22 08:56:19,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 15 [2020-06-22 08:56:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:19,321 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-06-22 08:56:19,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:56:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-06-22 08:56:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 08:56:19,322 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:19,322 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:19,322 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 799917429, now seen corresponding path program 1 times [2020-06-22 08:56:19,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:19,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:19,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:19,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:19,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:56:19,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:19,426 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 08:56:19,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:19,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 39 conjunts are in the unsatisfiable core [2020-06-22 08:56:19,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:19,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:56:19,473 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 08:56:19,473 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:19,486 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:19,487 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:19,487 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 [2020-06-22 08:56:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-06-22 08:56:19,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 08:56:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 08:56:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-06-22 08:56:19,712 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 18 states. [2020-06-22 08:56:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:20,955 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2020-06-22 08:56:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-06-22 08:56:20,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2020-06-22 08:56:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:20,957 INFO L225 Difference]: With dead ends: 66 [2020-06-22 08:56:20,957 INFO L226 Difference]: Without dead ends: 65 [2020-06-22 08:56:20,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2020-06-22 08:56:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-06-22 08:56:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 30. [2020-06-22 08:56:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:56:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-06-22 08:56:20,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 16 [2020-06-22 08:56:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:20,965 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-06-22 08:56:20,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 08:56:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-06-22 08:56:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 08:56:20,966 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:20,966 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:20,966 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 799917460, now seen corresponding path program 1 times [2020-06-22 08:56:20,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:20,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:20,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:20,997 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 08:56:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:21,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:56:21,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:21,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:21,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 08:56:21,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:56:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:21,079 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 5 states. [2020-06-22 08:56:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:21,156 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-06-22 08:56:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:56:21,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-06-22 08:56:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:21,157 INFO L225 Difference]: With dead ends: 37 [2020-06-22 08:56:21,157 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 08:56:21,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:56:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 08:56:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 08:56:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 08:56:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-06-22 08:56:21,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 16 [2020-06-22 08:56:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:21,162 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-06-22 08:56:21,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:56:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-06-22 08:56:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 08:56:21,163 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:21,163 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:21,163 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1587994113, now seen corresponding path program 1 times [2020-06-22 08:56:21,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:21,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:21,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:56:21,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:56:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:21,196 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-06-22 08:56:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:21,255 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-06-22 08:56:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:56:21,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-06-22 08:56:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:21,256 INFO L225 Difference]: With dead ends: 40 [2020-06-22 08:56:21,256 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 08:56:21,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 08:56:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-06-22 08:56:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 08:56:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-06-22 08:56:21,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 19 [2020-06-22 08:56:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:21,263 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-06-22 08:56:21,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:56:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-06-22 08:56:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:56:21,264 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:21,264 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:21,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1934946595, now seen corresponding path program 2 times [2020-06-22 08:56:21,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:21,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:21,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:56:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:56:21,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:56:21,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:56:21,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2020-06-22 08:56:21,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:21,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:56:21,583 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 08:56:21,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:21,591 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:21,592 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:21,592 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2020-06-22 08:56:21,619 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 08:56:21,620 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:21,628 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:21,629 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 08:56:21,629 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-06-22 08:56:21,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:56:21,721 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 08:56:21,722 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:21,732 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:21,733 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:56:21,733 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:22 [2020-06-22 08:56:21,816 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:21,816 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 08:56:21,817 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:56:21,830 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:21,833 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 08:56:21,833 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2020-06-22 08:56:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:21,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2020-06-22 08:56:21,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-06-22 08:56:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-06-22 08:56:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-06-22 08:56:21,965 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 21 states. [2020-06-22 08:56:22,712 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2020-06-22 08:56:23,317 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-06-22 08:56:23,865 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2020-06-22 08:56:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:24,075 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2020-06-22 08:56:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-06-22 08:56:24,076 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2020-06-22 08:56:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:24,077 INFO L225 Difference]: With dead ends: 66 [2020-06-22 08:56:24,077 INFO L226 Difference]: Without dead ends: 65 [2020-06-22 08:56:24,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2020-06-22 08:56:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-06-22 08:56:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2020-06-22 08:56:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 08:56:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2020-06-22 08:56:24,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 20 [2020-06-22 08:56:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:24,086 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2020-06-22 08:56:24,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-06-22 08:56:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2020-06-22 08:56:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 08:56:24,087 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:24,087 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:24,087 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 146196633, now seen corresponding path program 2 times [2020-06-22 08:56:24,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:24,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:24,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:24,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 08:56:24,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:24,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:56:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:56:24,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:56:24,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:56:24,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjunts are in the unsatisfiable core [2020-06-22 08:56:24,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:24,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:56:24,263 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 08:56:24,264 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:24,272 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:24,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:24,273 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 [2020-06-22 08:56:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-06-22 08:56:24,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 08:56:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 08:56:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-06-22 08:56:24,472 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand 20 states. [2020-06-22 08:56:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:25,792 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2020-06-22 08:56:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-06-22 08:56:25,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2020-06-22 08:56:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:25,793 INFO L225 Difference]: With dead ends: 106 [2020-06-22 08:56:25,793 INFO L226 Difference]: Without dead ends: 105 [2020-06-22 08:56:25,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=416, Invalid=1654, Unknown=0, NotChecked=0, Total=2070 [2020-06-22 08:56:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-06-22 08:56:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. [2020-06-22 08:56:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 08:56:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2020-06-22 08:56:25,802 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 21 [2020-06-22 08:56:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:25,802 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2020-06-22 08:56:25,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 08:56:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2020-06-22 08:56:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 08:56:25,803 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:25,804 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:25,804 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash 146226424, now seen corresponding path program 1 times [2020-06-22 08:56:25,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:25,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:25,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:25,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:56:25,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:25,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 08:56:25,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:25,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 08:56:25,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:56:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:25,906 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand 5 states. [2020-06-22 08:56:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:25,947 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2020-06-22 08:56:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:25,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-06-22 08:56:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:25,948 INFO L225 Difference]: With dead ends: 69 [2020-06-22 08:56:25,948 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 08:56:25,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:56:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 08:56:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 08:56:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 08:56:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-06-22 08:56:25,952 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2020-06-22 08:56:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:25,953 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-06-22 08:56:25,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:56:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-06-22 08:56:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-06-22 08:56:25,953 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:56:25,954 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:25,954 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 08:56:25,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1175388074, now seen corresponding path program 1 times [2020-06-22 08:56:25,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:56:26,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:56:26,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:56:26,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:26,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 52 conjunts are in the unsatisfiable core [2020-06-22 08:56:26,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:26,449 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 08:56:26,450 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,455 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,458 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 08:56:26,458 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,464 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,464 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 08:56:26,464 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 08:56:26,491 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 08:56:26,491 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,496 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,496 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,496 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 08:56:26,580 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 08:56:26,581 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,587 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,588 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 08:56:26,588 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-06-22 08:56:26,620 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 08:56:26,621 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:56:26,626 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,627 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 08:56:26,627 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 08:56:26,688 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,688 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 08:56:26,689 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:56:26,699 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:56:26,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:56:26,701 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 08:56:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:56:26,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:56:26,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2020-06-22 08:56:26,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-06-22 08:56:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-06-22 08:56:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-06-22 08:56:26,778 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 23 states. [2020-06-22 08:56:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:27,368 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-06-22 08:56:27,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 08:56:27,369 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2020-06-22 08:56:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:56:27,369 INFO L225 Difference]: With dead ends: 27 [2020-06-22 08:56:27,369 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:56:27,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2020-06-22 08:56:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:56:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:56:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:56:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:56:27,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-06-22 08:56:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:56:27,371 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:56:27,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-06-22 08:56:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:56:27,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:56:27,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:56:27,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:56:27,577 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 175 [2020-06-22 08:56:27,746 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-06-22 08:56:29,603 WARN L188 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 171 DAG size of output: 94 [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 28 42) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 08:56:29,607 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: (and (<= 1 ULTIMATE.start_cstrncpy_~n) (<= 1 ULTIMATE.start_main_~length~0) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= ULTIMATE.start_main_~nondetArea~0.offset 0) (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) (+ (select |#length| ULTIMATE.start_cstrncpy_~d~0.base) 1)) (= 0 ULTIMATE.start_cstrncpy_~dst.offset) (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)) (<= 1 (select |#length| ULTIMATE.start_cstrncpy_~src.base)) (<= 1 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base) 1) (= ULTIMATE.start_main_~nondetString~0.offset 0) (= 0 ULTIMATE.start_cstrncpy_~src.offset) (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base)) (= (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base)) (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1) (= (select |#valid| ULTIMATE.start_cstrncpy_~dst.base) 1)) [2020-06-22 08:56:29,607 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 22) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 36) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 23) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 23) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 24) no Hoare annotation was computed. [2020-06-22 08:56:29,608 INFO L444 ceAbstractionStarter]: At program point L16-4(lines 16 23) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_cstrncpy_~s~0.base))) (let ((.cse19 (<= 1 ULTIMATE.start_cstrncpy_~n)) (.cse2 (<= 1 ULTIMATE.start_main_~length~0)) (.cse5 (= 0 ULTIMATE.start_cstrncpy_~dst.offset)) (.cse6 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse8 (<= 1 ULTIMATE.start_main_~n~0)) (.cse9 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse10 (= (select |#valid| ULTIMATE.start_cstrncpy_~s~0.base) 1)) (.cse11 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse12 (= 0 ULTIMATE.start_cstrncpy_~src.offset)) (.cse14 (= (select |#valid| ULTIMATE.start_cstrncpy_~d~0.base) 1)) (.cse13 (<= ULTIMATE.start_cstrncpy_~n (select |#length| ULTIMATE.start_cstrncpy_~dst.base))) (.cse17 (= (select |#valid| ULTIMATE.start_cstrncpy_~dst.base) 1)) (.cse18 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse3 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse1 (select |#length| ULTIMATE.start_cstrncpy_~d~0.base)) (.cse4 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src.base))) (.cse16 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse20 (= (select (select |#memory_int| ULTIMATE.start_cstrncpy_~s~0.base) (+ .cse0 (- 1))) 0)) (.cse21 (not (= ULTIMATE.start_cstrncpy_~d~0.base ULTIMATE.start_cstrncpy_~s~0.base))) (.cse7 (select |#length| ULTIMATE.start_cstrncpy_~src.base))) (or (and (<= (+ ULTIMATE.start_cstrncpy_~s~0.offset 1) .cse0) (and (and (<= (+ ULTIMATE.start_cstrncpy_~d~0.offset ULTIMATE.start_cstrncpy_~n) .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 .cse7) .cse8 (<= 1 ULTIMATE.start_cstrncpy_~d~0.offset) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 1 ULTIMATE.start_cstrncpy_~s~0.offset) .cse16 .cse17)) .cse18 .cse19) .cse20 .cse21) (and (and .cse19 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse13 .cse17 .cse18 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 1 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_cstrncpy_~src.offset ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~src.base)))) .cse3 (<= ULTIMATE.start_cstrncpy_~n .cse1) .cse4 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstrncpy_~s~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length~0) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~s~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~s~0.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))))) .cse15 .cse16) .cse20 .cse21 (= 0 ULTIMATE.start_cstrncpy_~s~0.offset) (= ULTIMATE.start_cstrncpy_~d~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src.base) (+ .cse7 (- 1)))) (not (= ULTIMATE.start_cstrncpy_~src.base ULTIMATE.start_cstrncpy_~dst.base)))))) [2020-06-22 08:56:29,609 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2020-06-22 08:56:29,609 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:56:29,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,642 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:29,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:29,648 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,649 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,649 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,649 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,649 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:29,653 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:29,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:56:29 BasicIcfg [2020-06-22 08:56:29,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:56:29,656 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:56:29,656 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:56:29,659 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:56:29,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:56:29,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:56:12" (1/5) ... [2020-06-22 08:56:29,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8eb417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:56:29, skipping insertion in model container [2020-06-22 08:56:29,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:56:29,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:56:13" (2/5) ... [2020-06-22 08:56:29,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8eb417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:56:29, skipping insertion in model container [2020-06-22 08:56:29,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:56:29,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:56:13" (3/5) ... [2020-06-22 08:56:29,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8eb417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:56:29, skipping insertion in model container [2020-06-22 08:56:29,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:56:29,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:56:13" (4/5) ... [2020-06-22 08:56:29,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c8eb417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:56:29, skipping insertion in model container [2020-06-22 08:56:29,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:56:29,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:56:29" (5/5) ... [2020-06-22 08:56:29,664 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:56:29,685 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:56:29,685 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:56:29,685 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:56:29,685 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:56:29,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:56:29,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:56:29,685 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:56:29,686 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:56:29,686 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:56:29,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 08:56:29,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:56:29,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:29,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:29,698 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,698 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,698 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:56:29,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 08:56:29,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:56:29,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:29,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:29,700 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,700 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,705 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 17#L31true [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 14#L31-2true [75] L31-2-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 20#L34-1true [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 11#L39true [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) 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_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 21#L12true [136] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3) (< v_ULTIMATE.start_cstrncpy_~n_4 0)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 22#L16-4true [2020-06-22 08:56:29,706 INFO L796 eck$LassoCheckResult]: Loop: 22#L16-4true [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 10#L17true [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 6#L17-1true [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 4#L17-2true [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 5#L16-1true [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 25#L16-2true [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 22#L16-4true [2020-06-22 08:56:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1133079923, now seen corresponding path program 1 times [2020-06-22 08:56:29,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:29,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:29,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:29,736 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 08:56:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:29,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:56:29,737 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 08:56:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 1 times [2020-06-22 08:56:29,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:29,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:29,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:29,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:56:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:56:29,870 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2020-06-22 08:56:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:29,951 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2020-06-22 08:56:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:56:29,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 56 transitions. [2020-06-22 08:56:29,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:56:29,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 32 transitions. [2020-06-22 08:56:29,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 08:56:29,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 08:56:29,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2020-06-22 08:56:29,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:56:29,958 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-06-22 08:56:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2020-06-22 08:56:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2020-06-22 08:56:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 08:56:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-06-22 08:56:29,961 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 08:56:29,961 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 08:56:29,961 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:56:29,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 24 transitions. [2020-06-22 08:56:29,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:56:29,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:29,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:29,962 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,962 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:29,963 INFO L794 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 80#L31 [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 78#L31-2 [75] L31-2-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 79#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 75#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) 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_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 76#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 82#L16-4 [2020-06-22 08:56:29,963 INFO L796 eck$LassoCheckResult]: Loop: 82#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 74#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 72#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 68#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 69#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 71#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 82#L16-4 [2020-06-22 08:56:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1133079922, now seen corresponding path program 1 times [2020-06-22 08:56:29,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:29,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 2 times [2020-06-22 08:56:29,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:29,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -419895170, now seen corresponding path program 1 times [2020-06-22 08:56:29,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:29,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:30,009 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 08:56:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:56:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:56:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:56:30,111 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-06-22 08:56:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:30,190 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-06-22 08:56:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:56:30,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 42 transitions. [2020-06-22 08:56:30,191 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-06-22 08:56:30,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 42 transitions. [2020-06-22 08:56:30,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 08:56:30,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 08:56:30,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 42 transitions. [2020-06-22 08:56:30,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:56:30,193 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-06-22 08:56:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 42 transitions. [2020-06-22 08:56:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-06-22 08:56:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 08:56:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2020-06-22 08:56:30,194 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 08:56:30,195 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 08:56:30,195 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:56:30,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 38 transitions. [2020-06-22 08:56:30,196 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-06-22 08:56:30,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:30,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:30,196 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:30,196 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:30,197 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 137#L31 [109] L31-->L31-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 134#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 135#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 131#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) 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_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 132#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 139#L16-4 [2020-06-22 08:56:30,197 INFO L796 eck$LassoCheckResult]: Loop: 139#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 130#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 128#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 124#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 125#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 127#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 139#L16-4 [2020-06-22 08:56:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1134211980, now seen corresponding path program 1 times [2020-06-22 08:56:30,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 3 times [2020-06-22 08:56:30,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:30,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash 702526232, now seen corresponding path program 1 times [2020-06-22 08:56:30,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:30,296 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 08:56:30,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:56:30,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 08:56:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:56:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:56:30,417 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. cyclomatic complexity: 17 Second operand 8 states. [2020-06-22 08:56:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:56:30,611 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2020-06-22 08:56:30,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:56:30,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 64 transitions. [2020-06-22 08:56:30,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-06-22 08:56:30,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 64 transitions. [2020-06-22 08:56:30,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 08:56:30,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-06-22 08:56:30,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 64 transitions. [2020-06-22 08:56:30,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:56:30,615 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2020-06-22 08:56:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 64 transitions. [2020-06-22 08:56:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-06-22 08:56:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:56:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 50 transitions. [2020-06-22 08:56:30,617 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 50 transitions. [2020-06-22 08:56:30,617 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 50 transitions. [2020-06-22 08:56:30,617 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:56:30,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 50 transitions. [2020-06-22 08:56:30,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-06-22 08:56:30,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:30,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:30,619 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:30,619 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:56:30,619 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 223#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 224#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 226#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 218#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) 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_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 219#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 236#L16-4 [2020-06-22 08:56:30,620 INFO L796 eck$LassoCheckResult]: Loop: 236#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 240#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 239#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 238#L17-2 [145] L17-2-->L16-1: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 237#L16-1 [74] L16-1-->L16-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_8 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_7 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_8} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n] 235#L16-2 [149] L16-2-->L16-4: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~pre0_6| 0) InVars {ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_6|} OutVars{ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~pre0] 236#L16-4 [2020-06-22 08:56:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1136982543, now seen corresponding path program 1 times [2020-06-22 08:56:30,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:30,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash -850062387, now seen corresponding path program 4 times [2020-06-22 08:56:30,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -393360549, now seen corresponding path program 1 times [2020-06-22 08:56:30,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:56:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:31,030 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-06-22 08:56:31,154 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-06-22 08:56:31,168 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:31,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:31,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:31,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:31,170 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:31,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:31,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:31,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:31,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:56:31,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:31,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:31,188 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 08:56:31,194 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 08:56:31,196 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 08:56:31,199 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 08:56:31,201 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 08:56:31,203 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 08:56:31,205 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 08:56:31,207 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 08:56:31,211 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 08:56:31,213 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 08:56:31,216 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 08:56:31,219 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 08:56:31,221 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 08:56:31,223 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 08:56:31,225 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 08:56:31,227 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 08:56:31,517 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2020-06-22 08:56:31,648 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-06-22 08:56:31,648 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 08:56:31,650 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 08:56:31,652 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 08:56:32,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:32,103 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:32,105 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 08:56:32,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,112 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 08:56:32,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,115 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 08:56:32,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,121 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 08:56:32,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,124 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 08:56:32,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,126 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 08:56:32,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,128 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 08:56:32,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,130 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 08:56:32,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,136 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 08:56:32,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,138 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 08:56:32,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,140 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 08:56:32,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,142 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 08:56:32,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,145 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 08:56:32,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,147 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 08:56:32,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,149 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 08:56:32,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:32,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,153 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 08:56:32,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,159 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 08:56:32,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,164 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 08:56:32,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,168 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 08:56:32,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:32,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:32,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:32,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,170 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 08:56:32,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,178 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 08:56:32,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,196 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 08:56:32,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:32,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:56:32,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:32,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:32,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:32,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:32,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:32,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:32,262 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:32,295 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 08:56:32,296 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 08:56:32,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:32,299 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:56:32,299 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:32,300 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2020-06-22 08:56:32,339 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 08:56:32,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:32,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:56:32,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:32,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:56:32,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:32,482 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 08:56:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:32,646 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:32,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:56:32,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:32,660 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:56:32,665 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 08:56:32,666 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 32 states and 50 transitions. cyclomatic complexity: 21 Second operand 6 states. [2020-06-22 08:56:32,986 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 32 states and 50 transitions. cyclomatic complexity: 21. Second operand 6 states. Result 55 states and 84 transitions. Complement of second has 11 states. [2020-06-22 08:56:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 08:56:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 08:56:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-06-22 08:56:32,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 08:56:32,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:32,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 08:56:32,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:32,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 6 letters. Loop has 12 letters. [2020-06-22 08:56:32,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:32,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 84 transitions. [2020-06-22 08:56:32,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 08:56:32,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 36 states and 55 transitions. [2020-06-22 08:56:32,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 08:56:33,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 08:56:33,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 55 transitions. [2020-06-22 08:56:33,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:56:33,000 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 55 transitions. [2020-06-22 08:56:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 55 transitions. [2020-06-22 08:56:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-06-22 08:56:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 08:56:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2020-06-22 08:56:33,002 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2020-06-22 08:56:33,002 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2020-06-22 08:56:33,002 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:56:33,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions. [2020-06-22 08:56:33,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 08:56:33,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:56:33,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:56:33,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:56:33,004 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 08:56:33,005 INFO L794 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY [155] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 473#L31 [112] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 470#L31-2 [113] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 471#L34-1 [127] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_4| 0) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc8.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc9.base_4| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4|) 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_4|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_4|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_4| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_4| v_ULTIMATE.start_main_~length~0_7)) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_4| 1)) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, #valid=|v_#valid_6|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 467#L39 [156] L39-->L12: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_cstrncpy_~src.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString~0.base_8) (= v_ULTIMATE.start_cstrncpy_~n_9 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10) (= |v_ULTIMATE.start_cstrncpy_#in~dst.base_2| v_ULTIMATE.start_cstrncpy_~dst.base_5) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~src.base_2| v_ULTIMATE.start_cstrncpy_~src.base_4) (= |v_ULTIMATE.start_cstrncpy_#in~src.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7))) 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_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_7, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_5, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_#in~src.offset=|v_ULTIMATE.start_cstrncpy_#in~src.offset_2|, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_7, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_#t~pre0=|v_ULTIMATE.start_cstrncpy_#t~pre0_7|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_9, ULTIMATE.start_cstrncpy_#in~src.base=|v_ULTIMATE.start_cstrncpy_#in~src.base_2|, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_5, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_7|, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_4, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_#in~dst.offset=|v_ULTIMATE.start_cstrncpy_#in~dst.offset_2|, ULTIMATE.start_cstrncpy_#in~dst.base=|v_ULTIMATE.start_cstrncpy_#in~dst.base_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_4, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~dst.offset, ULTIMATE.start_cstrncpy_~dst.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#in~src.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_#t~pre0, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#in~src.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~pre4, ULTIMATE.start_cstrncpy_~src.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_#in~dst.offset, ULTIMATE.start_cstrncpy_#in~dst.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 468#L12 [135] L12-->L16-4: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_2 v_ULTIMATE.start_cstrncpy_~src.base_3) (> v_ULTIMATE.start_cstrncpy_~n_4 0) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_2 v_ULTIMATE.start_cstrncpy_~dst.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_2 v_ULTIMATE.start_cstrncpy_~dst.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_2 v_ULTIMATE.start_cstrncpy_~src.offset_3)) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_2, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst.offset=v_ULTIMATE.start_cstrncpy_~dst.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_2, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_2, ULTIMATE.start_cstrncpy_~dst.base=v_ULTIMATE.start_cstrncpy_~dst.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_2, ULTIMATE.start_cstrncpy_~src.base=v_ULTIMATE.start_cstrncpy_~src.base_3, ULTIMATE.start_cstrncpy_~src.offset=v_ULTIMATE.start_cstrncpy_~src.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~d~0.base] 476#L16-4 [86] L16-4-->L17: Formula: (and (= v_ULTIMATE.start_cstrncpy_~s~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_4) (= v_ULTIMATE.start_cstrncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~d~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~s~0.base_4) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_4, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_4, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_3, ULTIMATE.start_cstrncpy_~s~0.base=v_ULTIMATE.start_cstrncpy_~s~0.base_3, ULTIMATE.start_cstrncpy_~s~0.offset=v_ULTIMATE.start_cstrncpy_~s~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_~s~0.base, ULTIMATE.start_cstrncpy_~s~0.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 466#L17 [100] L17-->L17-1: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 464#L17-1 [94] L17-1-->L17-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|) (= (select |v_#valid_13| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 459#L17-2 [92] L17-2-->L19-3: Formula: (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 458#L19-3 [2020-06-22 08:56:33,005 INFO L796 eck$LassoCheckResult]: Loop: 458#L19-3 [98] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncpy_#t~pre4_2| .cse0))) InVars {ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6} OutVars{ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~pre4] 462#L19-1 [147] L19-1-->L20: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~d~0.offset_6) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~d~0.base_6) (= v_ULTIMATE.start_cstrncpy_~d~0.base_5 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~d~0.offset_5 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (> |v_ULTIMATE.start_cstrncpy_#t~pre4_6| 0)) InVars {ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_6, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_6|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_6} OutVars{ULTIMATE.start_cstrncpy_~d~0.offset=v_ULTIMATE.start_cstrncpy_~d~0.offset_5, ULTIMATE.start_cstrncpy_#t~pre4=|v_ULTIMATE.start_cstrncpy_#t~pre4_5|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|, ULTIMATE.start_cstrncpy_~d~0.base=v_ULTIMATE.start_cstrncpy_~d~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~d~0.offset, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~d~0.base, ULTIMATE.start_cstrncpy_#t~pre4] 469#L20 [160] L20-->L19-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 458#L19-3 [2020-06-22 08:56:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2051803749, now seen corresponding path program 1 times [2020-06-22 08:56:33,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:33,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 128686, now seen corresponding path program 1 times [2020-06-22 08:56:33,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:33,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 689169108, now seen corresponding path program 1 times [2020-06-22 08:56:33,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:56:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:56:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:56:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:56:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:33,677 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2020-06-22 08:56:33,803 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-06-22 08:56:33,805 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:56:33,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:56:33,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:56:33,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:56:33,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:56:33,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:56:33,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:56:33,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:56:33,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 08:56:33,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:56:33,806 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:56:33,809 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 08:56:33,817 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 08:56:33,819 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 08:56:33,821 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 08:56:33,823 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 08:56:33,825 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 08:56:33,827 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 08:56:33,829 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 08:56:33,831 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 08:56:33,833 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 08:56:33,836 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 08:56:33,838 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 08:56:33,840 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 08:56:33,842 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 08:56:33,844 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 08:56:34,136 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-06-22 08:56:34,225 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 08:56:34,227 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 08:56:34,229 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 08:56:34,230 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 08:56:34,725 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-06-22 08:56:34,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:56:34,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:56:34,769 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 08:56:34,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,776 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 08:56:34,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,779 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 08:56:34,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,781 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 08:56:34,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,783 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 08:56:34,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,785 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 08:56:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,787 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 08:56:34,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,789 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 08:56:34,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,791 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 08:56:34,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,793 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 08:56:34,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,796 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 08:56:34,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,798 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 08:56:34,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,800 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 08:56:34,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,802 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 08:56:34,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,804 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 08:56:34,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,811 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 08:56:34,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,815 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 08:56:34,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,819 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 08:56:34,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,822 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 08:56:34,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,824 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 08:56:34,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:56:34,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:56:34,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:56:34,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,826 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 08:56:34,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,829 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 08:56:34,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:56:34,843 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 08:56:34,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:56:34,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:56:34,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:56:34,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:56:34,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:56:34,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:56:34,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:56:34,909 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:56:34,910 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 08:56:34,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:56:34,911 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:56:34,911 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:56:34,911 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2 Supporting invariants [] [2020-06-22 08:56:34,944 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2020-06-22 08:56:34,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:56:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:34,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 08:56:34,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:56:34,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 08:56:34,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:56:35,005 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 08:56:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:56:35,040 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 08:56:35,041 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 08:56:35,041 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 4 loop predicates [2020-06-22 08:56:35,041 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states and 52 transitions. cyclomatic complexity: 21 Second operand 4 states. [2020-06-22 08:56:35,087 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states and 52 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 37 states and 57 transitions. Complement of second has 6 states. [2020-06-22 08:56:35,087 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 08:56:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 08:56:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2020-06-22 08:56:35,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 10 letters. Loop has 3 letters. [2020-06-22 08:56:35,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:35,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 13 letters. Loop has 3 letters. [2020-06-22 08:56:35,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:35,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 08:56:35,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:56:35,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 57 transitions. [2020-06-22 08:56:35,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:56:35,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2020-06-22 08:56:35,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:56:35,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:56:35,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:56:35,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:56:35,094 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:56:35,094 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:56:35,094 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:56:35,094 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:56:35,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:56:35,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:56:35,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:56:35,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:56:35 BasicIcfg [2020-06-22 08:56:35,101 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:56:35,101 INFO L168 Benchmark]: Toolchain (without parser) took 22374.34 ms. Allocated memory was 649.6 MB in the beginning and 966.3 MB in the end (delta: 316.7 MB). Free memory was 565.3 MB in the beginning and 507.9 MB in the end (delta: 57.4 MB). Peak memory consumption was 374.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,102 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:56:35,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.33 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 565.3 MB in the beginning and 644.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 682.1 MB. Free memory was 644.3 MB in the beginning and 643.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,103 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 ms. Allocated memory is still 682.1 MB. Free memory was 643.0 MB in the beginning and 641.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,104 INFO L168 Benchmark]: RCFGBuilder took 308.01 ms. Allocated memory is still 682.1 MB. Free memory was 640.3 MB in the beginning and 619.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,104 INFO L168 Benchmark]: BlockEncodingV2 took 118.97 ms. Allocated memory is still 682.1 MB. Free memory was 619.1 MB in the beginning and 609.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,104 INFO L168 Benchmark]: TraceAbstraction took 16132.16 ms. Allocated memory was 682.1 MB in the beginning and 920.1 MB in the end (delta: 238.0 MB). Free memory was 609.7 MB in the beginning and 501.3 MB in the end (delta: 108.4 MB). Peak memory consumption was 346.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,105 INFO L168 Benchmark]: BuchiAutomizer took 5444.91 ms. Allocated memory was 920.1 MB in the beginning and 966.3 MB in the end (delta: 46.1 MB). Free memory was 501.3 MB in the beginning and 507.9 MB in the end (delta: -6.6 MB). Peak memory consumption was 39.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:56:35,108 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 38 edges - StatisticsResult: Encoded RCFG 23 locations, 41 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 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 298.33 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 565.3 MB in the beginning and 644.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.35 ms. Allocated memory is still 682.1 MB. Free memory was 644.3 MB in the beginning and 643.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.35 ms. Allocated memory is still 682.1 MB. Free memory was 643.0 MB in the beginning and 641.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 308.01 ms. Allocated memory is still 682.1 MB. Free memory was 640.3 MB in the beginning and 619.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.97 ms. Allocated memory is still 682.1 MB. Free memory was 619.1 MB in the beginning and 609.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 16132.16 ms. Allocated memory was 682.1 MB in the beginning and 920.1 MB in the end (delta: 238.0 MB). Free memory was 609.7 MB in the beginning and 501.3 MB in the end (delta: 108.4 MB). Peak memory consumption was 346.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5444.91 ms. Allocated memory was 920.1 MB in the beginning and 966.3 MB in the end (delta: 46.1 MB). Free memory was 501.3 MB in the beginning and 507.9 MB in the end (delta: -6.6 MB). Peak memory consumption was 39.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-06-22 08:56:35,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,119 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((1 <= n && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && d + n <= unknown-#length-unknown[d] + 1) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && 1 <= d) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && n <= unknown-#length-unknown[dst]) && \valid[d] == 1) && 1 == \valid[src]) && 1 <= s) && \valid[nondetString] == 1) && \valid[dst] == 1 - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 08:56:35,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 08:56:35,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 08:56:35,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:56:35,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:56:35,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((s + 1 <= unknown-#length-unknown[s] && ((d + n <= unknown-#length-unknown[d] && ((((((((((((((((1 <= length && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && 1 <= d) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && n <= unknown-#length-unknown[dst]) && \valid[d] == 1) && 1 == \valid[src]) && 1 <= s) && \valid[nondetString] == 1) && \valid[dst] == 1) && !(nondetString == nondetArea)) && 1 <= n) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && !(d == s)) || (((((((((((((((((((((((((1 <= n && 1 <= length) && 0 == dst) && length == unknown-#length-unknown[nondetString]) && 1 <= n) && \valid[nondetArea] == 1) && \valid[s] == 1) && nondetString == 0) && 0 == src) && \valid[d] == 1) && n <= unknown-#length-unknown[dst]) && \valid[dst] == 1) && !(nondetString == nondetArea)) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] && 1 <= ULTIMATE.start_main_~length~0) && src <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src])) && n == unknown-#length-unknown[nondetArea]) && n <= unknown-#length-unknown[d]) && nondetArea == 0) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((s <= ULTIMATE.start_main_~nondetString~0.offset && 1 <= ULTIMATE.start_main_~length~0) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1])) && 1 == \valid[src]) && \valid[nondetString] == 1) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && !(d == s)) && 0 == s) && d == 0) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && !(src == dst)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 8 error locations. SAFE Result, 16.0s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 1528 SDslu, 1540 SDs, 0 SdLazy, 3346 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 137 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 366 HoareAnnotationTreeSize, 2 FomulaSimplifications, 9507 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 5606 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 478 ConstructedInterpolants, 12 QuantifiedInterpolants, 59404 SizeOfPredicates, 103 NumberOfNonLiveVariables, 1361 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 39/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * d + unknown-#length-unknown[alloca(n * sizeof(char))] and consists of 8 locations. One nondeterministic module has affine ranking function -1 * d + unknown-#length-unknown[d] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 63 SDtfs, 210 SDslu, 262 SDs, 0 SdLazy, 433 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf100 lsp97 ukn85 mio100 lsp48 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:56:09.478 ----------------------------------------------- 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 08:56:35.367 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check