YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:38:38,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:38:38,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:38:38,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:38:38,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:38:38,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:38:38,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:38:38,327 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:38:38,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:38:38,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:38:38,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:38:38,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:38:38,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:38:38,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:38:38,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:38:38,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:38:38,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:38:38,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:38:38,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:38:38,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:38:38,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:38:38,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:38:38,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:38:38,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:38:38,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:38:38,345 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:38:38,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:38:38,346 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:38:38,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:38:38,347 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:38:38,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:38:38,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:38:38,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:38:38,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:38:38,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:38:38,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:38:38,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:38:38,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:38:38,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:38:38,352 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:38:38,366 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:38:38,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:38:38,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:38:38,368 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:38:38,368 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:38:38,369 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:38:38,369 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:38:38,369 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:38:38,369 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:38:38,369 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:38:38,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:38:38,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:38:38,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:38:38,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:38:38,370 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:38:38,370 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:38:38,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:38:38,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:38:38,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:38:38,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:38:38,410 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:38:38,413 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:38:38,415 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:38:38,415 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:38:38,416 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:38:38,486 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/d489adfe293e49578c509b11f3117039/FLAGff7bc163c [2020-06-22 10:38:38,825 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:38:38,826 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:38:38,826 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:38:38,833 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/d489adfe293e49578c509b11f3117039/FLAGff7bc163c [2020-06-22 10:38:39,249 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/d489adfe293e49578c509b11f3117039 [2020-06-22 10:38:39,261 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:38:39,262 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:38:39,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:38:39,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:38:39,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:38:39,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301942e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39, skipping insertion in model container [2020-06-22 10:38:39,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:38:39,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:38:39,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:38:39,524 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:38:39,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:38:39,558 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:38:39,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39 WrapperNode [2020-06-22 10:38:39,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:38:39,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:38:39,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:38:39,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:38:39,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:38:39,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:38:39,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:38:39,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:38:39,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:38:39,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:38:39,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:38:39,623 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:38:39,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:38:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:38:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:38:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:38:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:38:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:38:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:38:39,914 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:38:39,915 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:38:39,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:39 BoogieIcfgContainer [2020-06-22 10:38:39,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:38:39,917 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:38:39,917 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:38:39,919 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:38:39,920 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:39" (1/1) ... [2020-06-22 10:38:39,940 INFO L313 BlockEncoder]: Initial Icfg 26 locations, 29 edges [2020-06-22 10:38:39,941 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:38:39,942 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:38:39,943 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:38:39,943 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:38:39,945 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:38:39,946 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:38:39,946 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:38:39,973 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:38:40,000 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-22 10:38:40,004 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:38:40,006 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:38:40,032 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 10:38:40,035 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:38:40,036 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:38:40,036 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:38:40,037 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:38:40,037 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:38:40,038 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 35 edges [2020-06-22 10:38:40,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:40 BasicIcfg [2020-06-22 10:38:40,039 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:38:40,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:38:40,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:38:40,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:38:40,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:38:39" (1/4) ... [2020-06-22 10:38:40,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720c3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:38:40, skipping insertion in model container [2020-06-22 10:38:40,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (2/4) ... [2020-06-22 10:38:40,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720c3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:38:40, skipping insertion in model container [2020-06-22 10:38:40,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:39" (3/4) ... [2020-06-22 10:38:40,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720c3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:40, skipping insertion in model container [2020-06-22 10:38:40,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:40" (4/4) ... [2020-06-22 10:38:40,047 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:38:40,058 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:38:40,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 10:38:40,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 10:38:40,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:38:40,113 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:38:40,114 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:38:40,114 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:38:40,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:38:40,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:38:40,114 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:38:40,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:38:40,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:38:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-06-22 10:38:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:38:40,136 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:38:40,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash 4470606, now seen corresponding path program 1 times [2020-06-22 10:38:40,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:40,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:40,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:38:40,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:38:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:38:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:40,335 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-06-22 10:38:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:40,425 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-06-22 10:38:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:38:40,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:38:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:40,440 INFO L225 Difference]: With dead ends: 20 [2020-06-22 10:38:40,440 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:38:40,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:38:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:38:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:38:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2020-06-22 10:38:40,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 4 [2020-06-22 10:38:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:40,482 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-22 10:38:40,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:38:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2020-06-22 10:38:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:38:40,483 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:38:40,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash 4470603, now seen corresponding path program 1 times [2020-06-22 10:38:40,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:40,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:38:40,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:38:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:38:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:40,509 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 3 states. [2020-06-22 10:38:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:40,578 INFO L93 Difference]: Finished difference Result 19 states and 34 transitions. [2020-06-22 10:38:40,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:38:40,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:38:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:40,579 INFO L225 Difference]: With dead ends: 19 [2020-06-22 10:38:40,579 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:38:40,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:38:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:38:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:38:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:38:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2020-06-22 10:38:40,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 4 [2020-06-22 10:38:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:40,585 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2020-06-22 10:38:40,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:38:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2020-06-22 10:38:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:38:40,585 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:38:40,586 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 4470605, now seen corresponding path program 1 times [2020-06-22 10:38:40,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:38:40,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:38:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:38:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:38:40,617 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. [2020-06-22 10:38:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:40,672 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. [2020-06-22 10:38:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:38:40,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 10:38:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:40,673 INFO L225 Difference]: With dead ends: 18 [2020-06-22 10:38:40,674 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:38:40,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:38:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:38:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:38:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:38:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-06-22 10:38:40,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 4 [2020-06-22 10:38:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:40,678 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2020-06-22 10:38:40,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:38:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2020-06-22 10:38:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:38:40,678 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:38:40,679 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1258387, now seen corresponding path program 1 times [2020-06-22 10:38:40,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:38:40,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:38:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:38:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:38:40,721 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. [2020-06-22 10:38:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:40,796 INFO L93 Difference]: Finished difference Result 17 states and 31 transitions. [2020-06-22 10:38:40,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:38:40,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:38:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:40,798 INFO L225 Difference]: With dead ends: 17 [2020-06-22 10:38:40,798 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:38:40,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:38:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:38:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:38:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:38:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-06-22 10:38:40,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 6 [2020-06-22 10:38:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:40,802 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-06-22 10:38:40,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:38:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-06-22 10:38:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:38:40,803 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:38:40,803 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1258389, now seen corresponding path program 1 times [2020-06-22 10:38:40,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:40,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:40,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:38:40,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:38:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:38:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:38:40,875 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2020-06-22 10:38:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:40,963 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. [2020-06-22 10:38:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:38:40,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-06-22 10:38:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:40,964 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:38:40,964 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:38:40,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:38:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:38:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 10:38:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:38:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-06-22 10:38:40,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-06-22 10:38:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:40,970 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-06-22 10:38:40,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:38:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-06-22 10:38:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:38:40,971 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:40,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:38:40,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash -938260353, now seen corresponding path program 1 times [2020-06-22 10:38:40,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:40,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:40,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:40,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:38:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:38:41,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:38:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:38:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:38:41,099 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 7 states. [2020-06-22 10:38:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:41,285 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2020-06-22 10:38:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:38:41,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 10:38:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:41,286 INFO L225 Difference]: With dead ends: 36 [2020-06-22 10:38:41,286 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:38:41,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:38:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:38:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:38:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:38:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 10:38:41,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 11 [2020-06-22 10:38:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:41,291 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 10:38:41,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:38:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 10:38:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:38:41,292 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:41,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:38:41,292 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 15977358, now seen corresponding path program 1 times [2020-06-22 10:38:41,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:41,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:41,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:41,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:41,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:41,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:38:41,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:38:41,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:41,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 10:38:41,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:41,590 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:38:41,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:38:41,598 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:41,599 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:41,599 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2020-06-22 10:38:41,677 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:41,678 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 10:38:41,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:38:41,698 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:41,704 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:41,704 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2020-06-22 10:38:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:41,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:38:41,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-06-22 10:38:41,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-06-22 10:38:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-06-22 10:38:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-06-22 10:38:41,812 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 13 states. [2020-06-22 10:38:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:45,641 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2020-06-22 10:38:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 10:38:45,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-06-22 10:38:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:45,642 INFO L225 Difference]: With dead ends: 53 [2020-06-22 10:38:45,642 INFO L226 Difference]: Without dead ends: 50 [2020-06-22 10:38:45,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-06-22 10:38:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-06-22 10:38:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 21. [2020-06-22 10:38:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:38:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-06-22 10:38:45,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 11 [2020-06-22 10:38:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:45,649 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-06-22 10:38:45,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-06-22 10:38:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-06-22 10:38:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:38:45,649 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:45,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:38:45,650 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 15977359, now seen corresponding path program 1 times [2020-06-22 10:38:45,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:45,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:45,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:38:45,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:38:45,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:45,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:38:45,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:45,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:38:45,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 10:38:45,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:38:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:38:45,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:38:45,753 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 6 states. [2020-06-22 10:38:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:45,830 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-06-22 10:38:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:38:45,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 10:38:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:45,831 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:38:45,831 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 10:38:45,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:38:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 10:38:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 10:38:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 10:38:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 10:38:45,836 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 11 [2020-06-22 10:38:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:45,836 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 10:38:45,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:38:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-06-22 10:38:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 10:38:45,837 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:45,837 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:38:45,837 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1478507482, now seen corresponding path program 2 times [2020-06-22 10:38:45,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:45,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:46,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:38:46,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:38:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:38:46,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:38:46,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:38:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 10:38:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:46,108 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:38:46,108 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:38:46,113 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:46,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:38:46,113 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:38:46,133 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 10:38:46,133 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:38:46,140 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:46,141 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:46,141 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 10:38:46,241 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:46,241 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 10:38:46,242 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:38:46,254 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:46,256 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:38:46,257 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2020-06-22 10:38:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:38:46,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:38:46,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 10:38:46,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 10:38:46,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 10:38:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:38:46,348 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 15 states. [2020-06-22 10:38:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:48,058 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2020-06-22 10:38:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-06-22 10:38:48,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2020-06-22 10:38:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:48,060 INFO L225 Difference]: With dead ends: 71 [2020-06-22 10:38:48,060 INFO L226 Difference]: Without dead ends: 70 [2020-06-22 10:38:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=450, Invalid=1272, Unknown=0, NotChecked=0, Total=1722 [2020-06-22 10:38:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-06-22 10:38:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. [2020-06-22 10:38:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 10:38:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-06-22 10:38:48,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 16 [2020-06-22 10:38:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:48,071 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-06-22 10:38:48,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 10:38:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-06-22 10:38:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 10:38:48,072 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:38:48,072 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:38:48,072 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 10:38:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash -787519795, now seen corresponding path program 1 times [2020-06-22 10:38:48,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:48,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 10:38:48,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:38:48,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:38:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:48,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 10:38:48,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:48,244 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:38:48,245 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:38:48,250 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:48,250 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:38:48,251 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 10:38:48,256 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 10:38:48,256 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:38:48,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:48,259 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:38:48,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:38:48,287 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:48,288 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 10:38:48,289 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:38:48,298 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:38:48,298 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:38:48,299 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 10:38:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 10:38:48,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:38:48,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-06-22 10:38:48,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 10:38:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 10:38:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:38:48,363 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 11 states. [2020-06-22 10:38:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:38:48,535 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-06-22 10:38:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:38:48,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-06-22 10:38:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:38:48,537 INFO L225 Difference]: With dead ends: 43 [2020-06-22 10:38:48,537 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:38:48,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-06-22 10:38:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:38:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:38:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:38:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:38:48,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-06-22 10:38:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:38:48,538 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:48,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 10:38:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:38:48,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:38:48,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:38:48,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:38:48,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:38:48,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:38:48,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:38:48,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:38:49,446 WARN L188 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2020-06-22 10:38:49,449 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 10:38:49,449 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-06-22 10:38:49,450 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-06-22 10:38:49,450 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-06-22 10:38:49,450 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:38:49,450 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 15) no Hoare annotation was computed. [2020-06-22 10:38:49,450 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 15) the Hoare annotation is: (let ((.cse8 (select |#memory_int| ULTIMATE.start_cstrreplace_~p~0.base)) (.cse10 (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base)) (.cse12 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse11 (select |#length| ULTIMATE.start_cstrreplace_~p~0.base))) (let ((.cse4 (<= 1 .cse11)) (.cse7 (= ULTIMATE.start_cstrreplace_~p~0.offset 0)) (.cse9 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse1 (= ULTIMATE.start_main_~length1~0 .cse12)) (.cse2 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrreplace_~p~0.base))) (.cse5 (= 0 (select .cse10 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse12 (- 1))))) (.cse6 (= (select .cse8 (+ .cse11 (- 1))) 0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0)))) .cse5 .cse6 .cse7) (and (= 0 (select .cse8 ULTIMATE.start_cstrreplace_~p~0.offset)) .cse9 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) 1) .cse0 .cse2 .cse1 .cse3 (= (select .cse10 ULTIMATE.start_main_~nondetString1~0.offset) 0) .cse4 .cse7) (and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) .cse11) .cse9 .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_cstrreplace_~p~0.offset) .cse5 .cse6)))) [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:38:49,451 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:38:49,452 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 13) no Hoare annotation was computed. [2020-06-22 10:38:49,452 INFO L448 ceAbstractionStarter]: For program point L10-3(lines 10 13) no Hoare annotation was computed. [2020-06-22 10:38:49,452 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:38:49,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,470 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:49,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:49,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:49,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:49 BasicIcfg [2020-06-22 10:38:49,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:38:49,487 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:38:49,487 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:38:49,490 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:38:49,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:49,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:38:39" (1/5) ... [2020-06-22 10:38:49,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:38:49, skipping insertion in model container [2020-06-22 10:38:49,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:49,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:38:39" (2/5) ... [2020-06-22 10:38:49,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:38:49, skipping insertion in model container [2020-06-22 10:38:49,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:49,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:38:39" (3/5) ... [2020-06-22 10:38:49,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:49, skipping insertion in model container [2020-06-22 10:38:49,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:49,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:38:40" (4/5) ... [2020-06-22 10:38:49,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:49, skipping insertion in model container [2020-06-22 10:38:49,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:38:49,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:38:49" (5/5) ... [2020-06-22 10:38:49,495 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:38:49,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:38:49,515 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:38:49,515 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:38:49,515 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:38:49,515 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:38:49,515 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:38:49,515 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:38:49,515 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:38:49,515 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:38:49,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 10:38:49,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:49,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:49,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:49,528 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:49,528 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:49,528 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:38:49,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 10:38:49,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:49,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:49,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:49,530 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:49,530 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:49,535 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 13#L21true [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 8#L21-2true [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 20#L25true [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 18#L25-1true [100] L25-1-->L9-3: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse1 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (> .cse0 127) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~new_1| (+ .cse1 (- 256))) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| (+ .cse0 (- 256))) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (> .cse1 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 3#L9-3true [2020-06-22 10:38:49,535 INFO L796 eck$LassoCheckResult]: Loop: 3#L9-3true [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 6#L9-1true [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 11#L10true [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 10#L10-1true [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 5#L10-3true [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 3#L9-3true [2020-06-22 10:38:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash 139095333, now seen corresponding path program 1 times [2020-06-22 10:38:49,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:49,567 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 1 times [2020-06-22 10:38:49,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:49,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:49,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:49,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash -664638795, now seen corresponding path program 1 times [2020-06-22 10:38:49,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:49,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:49,813 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-06-22 10:38:49,890 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:49,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:49,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:49,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:49,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:38:49,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:38:49,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:49,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:49,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:38:49,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:49,893 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:49,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:50,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:50,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:50,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:50,406 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:50,411 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:38:50,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:50,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:50,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:50,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:50,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:50,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:50,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:50,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:50,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:50,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:50,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:50,500 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:38:50,519 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:38:50,520 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:38:50,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:38:50,523 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:38:50,524 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:38:50,524 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2020-06-22 10:38:50,538 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:38:50,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:50,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:38:50,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:50,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:50,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:50,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:50,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:50,712 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:38:50,717 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:38:50,718 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states. Second operand 4 states. [2020-06-22 10:38:50,849 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states.. Second operand 4 states. Result 45 states and 84 transitions. Complement of second has 8 states. [2020-06-22 10:38:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:38:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:38:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-06-22 10:38:50,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 10:38:50,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:50,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 10:38:50,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:50,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 10:38:50,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:50,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 84 transitions. [2020-06-22 10:38:50,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:50,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 11 states and 18 transitions. [2020-06-22 10:38:50,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:38:50,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:38:50,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2020-06-22 10:38:50,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:38:50,866 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 10:38:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2020-06-22 10:38:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:38:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:38:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-06-22 10:38:50,868 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 10:38:50,868 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 10:38:50,868 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:38:50,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. [2020-06-22 10:38:50,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:50,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:50,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:50,869 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:50,870 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:50,870 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 165#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 166#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 173#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 172#L25-1 [99] L25-1-->L9-3: Formula: (let ((.cse1 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse0 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= .cse0 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| .cse1) (<= .cse0 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 170#L9-3 [2020-06-22 10:38:50,870 INFO L796 eck$LassoCheckResult]: Loop: 170#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 171#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 163#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 164#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 169#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 170#L9-3 [2020-06-22 10:38:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash 139095332, now seen corresponding path program 1 times [2020-06-22 10:38:50,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:50,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:50,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:50,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 2 times [2020-06-22 10:38:50,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -693267946, now seen corresponding path program 1 times [2020-06-22 10:38:50,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:50,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:50,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:51,132 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-06-22 10:38:51,221 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:51,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:51,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:51,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:51,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:38:51,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:38:51,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:51,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:51,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:38:51,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:51,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:51,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 10:38:51,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 10:38:51,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,394 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-06-22 10:38:51,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:51,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:51,801 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:38:51,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 10:38:51,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:51,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:51,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:51,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:51,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:51,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:51,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:51,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:51,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:51,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:51,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:51,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:51,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:51,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:51,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:51,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:51,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:51,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:38:51,887 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:38:51,888 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:38:51,888 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:38:51,889 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:38:51,889 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:38:51,889 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_2, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_2 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2020-06-22 10:38:51,922 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:38:51,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:51,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:38:51,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:51,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:51,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:52,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:52,080 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:38:52,081 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:38:52,081 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 18 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-06-22 10:38:52,138 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 18 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 23 states and 37 transitions. Complement of second has 5 states. [2020-06-22 10:38:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:38:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:38:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2020-06-22 10:38:52,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 10:38:52,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:52,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 10:38:52,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:52,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 10:38:52,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:52,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 37 transitions. [2020-06-22 10:38:52,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:52,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 17 transitions. [2020-06-22 10:38:52,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:38:52,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:38:52,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2020-06-22 10:38:52,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:38:52,145 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:38:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2020-06-22 10:38:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:38:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:38:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:38:52,146 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:38:52,146 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:38:52,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:38:52,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:38:52,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:52,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:52,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:52,147 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:52,147 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:52,148 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 291#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 292#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 299#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 298#L25-1 [98] L25-1-->L9-3: Formula: (let ((.cse1 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse0 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~new_1| (+ .cse0 (- 256))) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| .cse1) (> .cse0 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 296#L9-3 [2020-06-22 10:38:52,148 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 297#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 289#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 290#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 295#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 296#L9-3 [2020-06-22 10:38:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash 139095331, now seen corresponding path program 1 times [2020-06-22 10:38:52,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:52,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:52,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:52,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 3 times [2020-06-22 10:38:52,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:52,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash -721897097, now seen corresponding path program 1 times [2020-06-22 10:38:52,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:52,407 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-06-22 10:38:52,496 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:52,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:52,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:52,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:52,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:38:52,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:38:52,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:52,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:52,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:38:52,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:52,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:52,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,668 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-06-22 10:38:52,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:52,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,120 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:53,120 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:38:53,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:53,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:53,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:53,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,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 10:38:53,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:53,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:53,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:53,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,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 10:38:53,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:53,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:53,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:53,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:53,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:53,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:53,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:53,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:53,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:53,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:53,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:53,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:53,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:53,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:53,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:53,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:53,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:53,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:53,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:53,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:53,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:53,152 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:38:53,163 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:38:53,163 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:38:53,164 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:38:53,165 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:38:53,165 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:38:53,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_3, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_3 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2020-06-22 10:38:53,175 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:38:53,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:53,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:38:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:53,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:53,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:53,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:53,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:53,358 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:38:53,359 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:38:53,359 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-06-22 10:38:53,419 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 23 states and 36 transitions. Complement of second has 5 states. [2020-06-22 10:38:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:38:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:38:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-06-22 10:38:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 10:38:53,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:53,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 10:38:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:53,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 10:38:53,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:53,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 36 transitions. [2020-06-22 10:38:53,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:53,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 16 transitions. [2020-06-22 10:38:53,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:38:53,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:38:53,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-06-22 10:38:53,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:38:53,425 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 10:38:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-06-22 10:38:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:38:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:38:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-06-22 10:38:53,427 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 10:38:53,427 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 10:38:53,427 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:38:53,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-06-22 10:38:53,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:38:53,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:38:53,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:38:53,428 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:53,428 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:38:53,429 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY [117] ULTIMATE.startENTRY-->L21: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 417#L21 [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 418#L21-2 [92] L21-2-->L25: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 425#L25 [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 424#L25-1 [97] L25-1-->L9-3: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256)) (.cse1 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (> .cse0 127) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (= .cse1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| (+ .cse0 (- 256))) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (<= .cse1 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 422#L9-3 [2020-06-22 10:38:53,429 INFO L796 eck$LassoCheckResult]: Loop: 422#L9-3 [52] L9-3-->L9-1: Formula: (and (= (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3) 1) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 423#L9-1 [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 415#L10 [58] L10-->L10-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6) 1) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 416#L10-1 [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 421#L10-3 [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 422#L9-3 [2020-06-22 10:38:53,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 139095330, now seen corresponding path program 1 times [2020-06-22 10:38:53,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 4 times [2020-06-22 10:38:53,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:53,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:38:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash -750526248, now seen corresponding path program 1 times [2020-06-22 10:38:53,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:38:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:38:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:38:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:38:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:38:53,661 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-06-22 10:38:53,766 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-06-22 10:38:53,772 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:38:53,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:38:53,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:38:53,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:38:53,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:38:53,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:38:53,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:38:53,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:38:53,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:38:53,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:38:53,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:38:53,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:53,975 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2020-06-22 10:38:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:38:54,388 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:38:54,388 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:38:54,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:54,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:54,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:54,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:54,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:54,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:54,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:54,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:54,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:54,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:54,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:54,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:38:54,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:38:54,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:38:54,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:54,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:54,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:38:54,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:38:54,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:38:54,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:38:54,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:38:54,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:38:54,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:38:54,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:38:54,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:38:54,422 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:38:54,423 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:38:54,423 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:38:54,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:38:54,424 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:38:54,424 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_4, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_4 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2020-06-22 10:38:54,433 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 10:38:54,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:38:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:54,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:38:54,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:54,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:54,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:38:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:38:54,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:38:54,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:38:54,596 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:38:54,597 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 10:38:54,597 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-22 10:38:54,672 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 17 states and 26 transitions. Complement of second has 5 states. [2020-06-22 10:38:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:38:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:38:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-06-22 10:38:54,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 10:38:54,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:54,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 10:38:54,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:54,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 10:38:54,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:38:54,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 26 transitions. [2020-06-22 10:38:54,677 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:38:54,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2020-06-22 10:38:54,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:38:54,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:38:54,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:38:54,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:38:54,678 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:54,678 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:54,678 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:38:54,678 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:38:54,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:38:54,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:38:54,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:38:54,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:38:54 BasicIcfg [2020-06-22 10:38:54,684 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:38:54,685 INFO L168 Benchmark]: Toolchain (without parser) took 15423.55 ms. Allocated memory was 649.6 MB in the beginning and 928.0 MB in the end (delta: 278.4 MB). Free memory was 558.5 MB in the beginning and 709.8 MB in the end (delta: -151.3 MB). Peak memory consumption was 127.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,685 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 579.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:38:54,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.20 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 558.5 MB in the beginning and 643.0 MB in the end (delta: -84.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 680.0 MB. Free memory was 643.0 MB in the beginning and 640.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,687 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 ms. Allocated memory is still 680.0 MB. Free memory was 640.9 MB in the beginning and 639.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,687 INFO L168 Benchmark]: RCFGBuilder took 293.50 ms. Allocated memory is still 680.0 MB. Free memory was 639.8 MB in the beginning and 619.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,688 INFO L168 Benchmark]: BlockEncodingV2 took 121.93 ms. Allocated memory is still 680.0 MB. Free memory was 619.5 MB in the beginning and 612.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,688 INFO L168 Benchmark]: TraceAbstraction took 9446.46 ms. Allocated memory was 680.0 MB in the beginning and 838.3 MB in the end (delta: 158.3 MB). Free memory was 612.0 MB in the beginning and 773.4 MB in the end (delta: -161.4 MB). Peak memory consumption was 315.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,689 INFO L168 Benchmark]: BuchiAutomizer took 5197.62 ms. Allocated memory was 838.3 MB in the beginning and 928.0 MB in the end (delta: 89.7 MB). Free memory was 773.4 MB in the beginning and 709.8 MB in the end (delta: 63.6 MB). Peak memory consumption was 153.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:38:54,693 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 26 locations, 29 edges - StatisticsResult: Encoded RCFG 19 locations, 35 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 579.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.20 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 558.5 MB in the beginning and 643.0 MB in the end (delta: -84.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 680.0 MB. Free memory was 643.0 MB in the beginning and 640.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.53 ms. Allocated memory is still 680.0 MB. Free memory was 640.9 MB in the beginning and 639.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 293.50 ms. Allocated memory is still 680.0 MB. Free memory was 639.8 MB in the beginning and 619.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 121.93 ms. Allocated memory is still 680.0 MB. Free memory was 619.5 MB in the beginning and 612.0 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 9446.46 ms. Allocated memory was 680.0 MB in the beginning and 838.3 MB in the end (delta: 158.3 MB). Free memory was 612.0 MB in the beginning and 773.4 MB in the end (delta: -161.4 MB). Peak memory consumption was 315.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5197.62 ms. Allocated memory was 838.3 MB in the beginning and 928.0 MB in the end (delta: 89.7 MB). Free memory was 773.4 MB in the beginning and 709.8 MB in the end (delta: 63.6 MB). Peak memory consumption was 153.2 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_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: 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: 9]: Loop Invariant [2020-06-22 10:38:54,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:38:54,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,710 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,711 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,712 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:38:54,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:38:54,713 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[nondetString1] && length1 == unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && 1 == \valid[p]) && 1 <= unknown-#length-unknown[p]) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) && p == 0) || (((((((((0 == unknown-#memory_int-unknown[p][p] && 1 <= length1) && nondetString1 + length1 <= 1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[p]) && unknown-#memory_int-unknown[nondetString1][nondetString1] == 0) && 1 <= unknown-#length-unknown[p]) && p == 0)) || ((((((((p + 1 <= unknown-#length-unknown[p] && 1 <= length1) && 1 == \valid[nondetString1]) && length1 == unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && 1 == \valid[p]) && 1 <= p) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 9.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 873 SDslu, 176 SDs, 0 SdLazy, 735 SolverSat, 361 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 9 NumberOfFragments, 178 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1860 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1088 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 139 ConstructedInterpolants, 15 QuantifiedInterpolants, 20497 SizeOfPredicates, 31 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 17/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * p and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 270 SDslu, 48 SDs, 0 SdLazy, 196 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf100 lsp84 ukn89 mio100 lsp40 div126 bol100 ite100 ukn100 eq150 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:38:36.043 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:38:54.949 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check