YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:34:25,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:34:25,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:34:25,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:34:25,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:34:25,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:34:25,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:34:25,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:34:25,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:34:25,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:34:25,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:34:25,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:34:25,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:34:25,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:34:25,535 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:34:25,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:34:25,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:34:25,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:34:25,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:34:25,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:34:25,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:34:25,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:34:25,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:34:25,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:34:25,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:34:25,547 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:34:25,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:34:25,548 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:34:25,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:34:25,549 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:34:25,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:34:25,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:34:25,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:34:25,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:34:25,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:34:25,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:34:25,553 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:34:25,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:34:25,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:34:25,554 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:34:25,569 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:34:25,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:34:25,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:34:25,571 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:34:25,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:34:25,571 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:34:25,571 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:34:25,572 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:34:25,572 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:34:25,572 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:34:25,572 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:34:25,572 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:34:25,572 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:34:25,573 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:34:25,573 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:34:25,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:34:25,573 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:34:25,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:34:25,574 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:34:25,574 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:34:25,574 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:34:25,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:34:25,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:34:25,575 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:34:25,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:34:25,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:34:25,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:34:25,575 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:34:25,576 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:34:25,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:34:25,616 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:34:25,619 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:34:25,621 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:34:25,621 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:34:25,622 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:34:25,689 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/b62b2c21bd5b435288dd78f5fd1fdb44/FLAG97ab936d8 [2020-06-22 09:34:26,028 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:34:26,029 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:34:26,029 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:34:26,036 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/b62b2c21bd5b435288dd78f5fd1fdb44/FLAG97ab936d8 [2020-06-22 09:34:26,421 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/b62b2c21bd5b435288dd78f5fd1fdb44 [2020-06-22 09:34:26,433 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:34:26,434 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:34:26,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:34:26,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:34:26,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:34:26,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625504db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26, skipping insertion in model container [2020-06-22 09:34:26,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:34:26,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:34:26,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:34:26,648 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:34:26,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:34:26,746 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:34:26,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26 WrapperNode [2020-06-22 09:34:26,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:34:26,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:34:26,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:34:26,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:34:26,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:34:26,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:34:26,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:34:26,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:34:26,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... [2020-06-22 09:34:26,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:34:26,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:34:26,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:34:26,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:34:26,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:34:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:34:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:34:26,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:34:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:34:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:34:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:34:27,180 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:34:27,180 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:34:27,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:27 BoogieIcfgContainer [2020-06-22 09:34:27,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:34:27,183 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:34:27,183 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:34:27,185 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:34:27,186 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:27" (1/1) ... [2020-06-22 09:34:27,205 INFO L313 BlockEncoder]: Initial Icfg 39 locations, 44 edges [2020-06-22 09:34:27,209 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:34:27,210 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:34:27,210 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:34:27,211 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:34:27,212 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:34:27,213 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:34:27,213 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:34:27,239 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:34:27,271 INFO L200 BlockEncoder]: SBE split 18 edges [2020-06-22 09:34:27,276 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:34:27,277 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:34:27,309 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:34:27,312 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 09:34:27,313 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:34:27,313 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:34:27,314 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:34:27,314 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:34:27,315 INFO L313 BlockEncoder]: Encoded RCFG 29 locations, 53 edges [2020-06-22 09:34:27,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:27 BasicIcfg [2020-06-22 09:34:27,315 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:34:27,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:34:27,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:34:27,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:34:27,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:34:26" (1/4) ... [2020-06-22 09:34:27,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9f10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:34:27, skipping insertion in model container [2020-06-22 09:34:27,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (2/4) ... [2020-06-22 09:34:27,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9f10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:34:27, skipping insertion in model container [2020-06-22 09:34:27,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:27" (3/4) ... [2020-06-22 09:34:27,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9f10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:27, skipping insertion in model container [2020-06-22 09:34:27,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:27" (4/4) ... [2020-06-22 09:34:27,325 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:34:27,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:34:27,343 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 09:34:27,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 09:34:27,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:34:27,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:34:27,388 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:34:27,389 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:34:27,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:34:27,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:34:27,389 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:34:27,389 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:34:27,389 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:34:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-06-22 09:34:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:27,411 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:27,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:27,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash 193728502, now seen corresponding path program 1 times [2020-06-22 09:34:27,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:27,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:27,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:27,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:27,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:27,620 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-06-22 09:34:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:27,733 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2020-06-22 09:34:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:27,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:34:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:27,749 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:34:27,749 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:34:27,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:34:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:34:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-06-22 09:34:27,791 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 5 [2020-06-22 09:34:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:27,793 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 09:34:27,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-06-22 09:34:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:27,793 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:27,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:27,794 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 193728504, now seen corresponding path program 1 times [2020-06-22 09:34:27,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:27,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:27,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:27,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:27,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:27,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:27,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:27,863 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 3 states. [2020-06-22 09:34:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:27,941 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. [2020-06-22 09:34:27,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:27,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:34:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:27,942 INFO L225 Difference]: With dead ends: 29 [2020-06-22 09:34:27,943 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:34:27,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:34:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:34:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 50 transitions. [2020-06-22 09:34:27,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 50 transitions. Word has length 5 [2020-06-22 09:34:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:27,949 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 50 transitions. [2020-06-22 09:34:27,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-06-22 09:34:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:34:27,949 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:27,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:34:27,950 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash 193728505, now seen corresponding path program 1 times [2020-06-22 09:34:27,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:27,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:27,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:27,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:27,987 INFO L87 Difference]: Start difference. First operand 28 states and 50 transitions. Second operand 4 states. [2020-06-22 09:34:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,079 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. [2020-06-22 09:34:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:28,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:34:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,081 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:34:28,081 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:34:28,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:34:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:34:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:34:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2020-06-22 09:34:28,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 5 [2020-06-22 09:34:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,086 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. [2020-06-22 09:34:28,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. [2020-06-22 09:34:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:34:28,086 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,087 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614953, now seen corresponding path program 1 times [2020-06-22 09:34:28,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:28,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,116 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 3 states. [2020-06-22 09:34:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,174 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2020-06-22 09:34:28,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:28,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:34:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,175 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:34:28,175 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 09:34:28,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 09:34:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 09:34:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 09:34:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 47 transitions. [2020-06-22 09:34:28,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 47 transitions. Word has length 6 [2020-06-22 09:34:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,180 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 47 transitions. [2020-06-22 09:34:28,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 47 transitions. [2020-06-22 09:34:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:34:28,181 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614955, now seen corresponding path program 1 times [2020-06-22 09:34:28,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:28,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:28,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,216 INFO L87 Difference]: Start difference. First operand 26 states and 47 transitions. Second operand 3 states. [2020-06-22 09:34:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,280 INFO L93 Difference]: Finished difference Result 27 states and 47 transitions. [2020-06-22 09:34:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:28,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 09:34:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,281 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:34:28,281 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 09:34:28,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 09:34:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 09:34:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 09:34:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2020-06-22 09:34:28,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 6 [2020-06-22 09:34:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,286 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. [2020-06-22 09:34:28,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. [2020-06-22 09:34:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 09:34:28,287 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1710614956, now seen corresponding path program 1 times [2020-06-22 09:34:28,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:28,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:28,327 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 4 states. [2020-06-22 09:34:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,401 INFO L93 Difference]: Finished difference Result 26 states and 46 transitions. [2020-06-22 09:34:28,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:28,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 09:34:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,402 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:34:28,402 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:34:28,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:34:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:34:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:34:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2020-06-22 09:34:28,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 6 [2020-06-22 09:34:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,407 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. [2020-06-22 09:34:28,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. [2020-06-22 09:34:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:34:28,407 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,408 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457162, now seen corresponding path program 1 times [2020-06-22 09:34:28,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:28,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:28,459 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand 4 states. [2020-06-22 09:34:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,540 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2020-06-22 09:34:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:28,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:34:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,541 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:34:28,541 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:34:28,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:34:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:34:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:34:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:34:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 39 transitions. [2020-06-22 09:34:28,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 39 transitions. Word has length 7 [2020-06-22 09:34:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,546 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 39 transitions. [2020-06-22 09:34:28,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. [2020-06-22 09:34:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:34:28,547 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457164, now seen corresponding path program 1 times [2020-06-22 09:34:28,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:28,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:28,596 INFO L87 Difference]: Start difference. First operand 22 states and 39 transitions. Second operand 4 states. [2020-06-22 09:34:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,712 INFO L93 Difference]: Finished difference Result 41 states and 67 transitions. [2020-06-22 09:34:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:28,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:34:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,715 INFO L225 Difference]: With dead ends: 41 [2020-06-22 09:34:28,715 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 09:34:28,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:34:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 09:34:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-06-22 09:34:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:34:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 60 transitions. [2020-06-22 09:34:28,721 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 60 transitions. Word has length 7 [2020-06-22 09:34:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 60 transitions. [2020-06-22 09:34:28,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 60 transitions. [2020-06-22 09:34:28,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:34:28,722 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,722 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1489457165, now seen corresponding path program 1 times [2020-06-22 09:34:28,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:34:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:34:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:34:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:34:28,789 INFO L87 Difference]: Start difference. First operand 30 states and 60 transitions. Second operand 6 states. [2020-06-22 09:34:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,895 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. [2020-06-22 09:34:28,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:34:28,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 09:34:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,897 INFO L225 Difference]: With dead ends: 38 [2020-06-22 09:34:28,897 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:34:28,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:34:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:34:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-06-22 09:34:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:34:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-06-22 09:34:28,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 7 [2020-06-22 09:34:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,902 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-06-22 09:34:28,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:34:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-06-22 09:34:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:34:28,903 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,903 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash 27818419, now seen corresponding path program 1 times [2020-06-22 09:34:28,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:28,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:28,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:28,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:28,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:28,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,935 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 3 states. [2020-06-22 09:34:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:28,977 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. [2020-06-22 09:34:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:28,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 09:34:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:28,978 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:34:28,979 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:34:28,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:34:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:34:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-06-22 09:34:28,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 11 [2020-06-22 09:34:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:28,984 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 09:34:28,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-06-22 09:34:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:34:28,984 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:28,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:28,985 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 27818421, now seen corresponding path program 1 times [2020-06-22 09:34:28,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:29,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:34:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:34:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:34:29,016 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 4 states. [2020-06-22 09:34:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,081 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2020-06-22 09:34:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:34:29,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 09:34:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,082 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:34:29,083 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:34:29,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:34:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:34:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-06-22 09:34:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:34:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-06-22 09:34:29,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 11 [2020-06-22 09:34:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,088 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-06-22 09:34:29,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:34:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-06-22 09:34:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:34:29,088 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,089 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash 27818422, now seen corresponding path program 1 times [2020-06-22 09:34:29,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:29,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:34:29,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:34:29,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:34:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:34:29,142 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 5 states. [2020-06-22 09:34:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,238 INFO L93 Difference]: Finished difference Result 31 states and 51 transitions. [2020-06-22 09:34:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:34:29,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 09:34:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,239 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:34:29,239 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:34:29,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:34:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:34:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:34:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:34:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 09:34:29,243 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 11 [2020-06-22 09:34:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,243 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 09:34:29,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:34:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-06-22 09:34:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:34:29,244 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,244 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 27818681, now seen corresponding path program 1 times [2020-06-22 09:34:29,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:29,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:29,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:29,286 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 3 states. [2020-06-22 09:34:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,328 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. [2020-06-22 09:34:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:29,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 09:34:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,329 INFO L225 Difference]: With dead ends: 46 [2020-06-22 09:34:29,329 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:34:29,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:34:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-06-22 09:34:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:34:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. [2020-06-22 09:34:29,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 11 [2020-06-22 09:34:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,334 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. [2020-06-22 09:34:29,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. [2020-06-22 09:34:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:34:29,334 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 27848472, now seen corresponding path program 1 times [2020-06-22 09:34:29,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:29,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:29,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:34:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:29,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:29,362 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand 3 states. [2020-06-22 09:34:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,407 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2020-06-22 09:34:29,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:29,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 09:34:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,408 INFO L225 Difference]: With dead ends: 49 [2020-06-22 09:34:29,408 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:34:29,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:34:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:34:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-06-22 09:34:29,411 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 11 [2020-06-22 09:34:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,412 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-06-22 09:34:29,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:34:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-06-22 09:34:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:34:29,412 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash -191964867, now seen corresponding path program 1 times [2020-06-22 09:34:29,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:29,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 09:34:29,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:34:29,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 09:34:29,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:34:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:34:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:34:29,555 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 6 states. [2020-06-22 09:34:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,645 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-06-22 09:34:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:34:29,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-06-22 09:34:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,646 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:34:29,646 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:34:29,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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 09:34:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:34:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-06-22 09:34:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-06-22 09:34:29,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 14 [2020-06-22 09:34:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,650 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-06-22 09:34:29,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:34:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-06-22 09:34:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:34:29,651 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -191964866, now seen corresponding path program 1 times [2020-06-22 09:34:29,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:29,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:29,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:34:29,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:34:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:34:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:34:29,765 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 7 states. [2020-06-22 09:34:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:29,949 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2020-06-22 09:34:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:34:29,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-06-22 09:34:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:29,950 INFO L225 Difference]: With dead ends: 55 [2020-06-22 09:34:29,951 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:34:29,951 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 09:34:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:34:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-06-22 09:34:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-06-22 09:34:29,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-06-22 09:34:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:29,955 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-06-22 09:34:29,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:34:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-06-22 09:34:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 09:34:29,955 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:29,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:29,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1577732512, now seen corresponding path program 1 times [2020-06-22 09:34:29,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:30,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:30,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:30,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 09:34:30,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:30,228 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 09:34:30,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:30,242 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:30,243 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:30,243 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 09:34:30,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:30,315 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 09:34:30,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:30,340 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:30,342 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:30,342 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 09:34:30,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:30,573 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:30,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 69 [2020-06-22 09:34:30,575 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:30,679 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-06-22 09:34:30,680 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2020-06-22 09:34:30,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:30,700 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:61, output treesize:72 [2020-06-22 09:34:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2020-06-22 09:34:30,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:34:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:34:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:34:30,869 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 18 states. [2020-06-22 09:34:31,560 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2020-06-22 09:34:32,128 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-06-22 09:34:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:33,773 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-06-22 09:34:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-06-22 09:34:33,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2020-06-22 09:34:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:33,774 INFO L225 Difference]: With dead ends: 75 [2020-06-22 09:34:33,775 INFO L226 Difference]: Without dead ends: 72 [2020-06-22 09:34:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2020-06-22 09:34:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-06-22 09:34:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 28. [2020-06-22 09:34:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-06-22 09:34:33,780 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-06-22 09:34:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:33,781 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-06-22 09:34:33,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:34:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-06-22 09:34:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 09:34:33,781 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:33,782 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:33,782 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1513783672, now seen corresponding path program 1 times [2020-06-22 09:34:33,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:33,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:33,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:33,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:33,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 09:34:33,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 09:34:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 09:34:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:34:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:34:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:34:33,892 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 6 states. [2020-06-22 09:34:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:33,967 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-06-22 09:34:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:34:33,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-06-22 09:34:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:33,968 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:34:33,969 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:34:33,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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 09:34:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:34:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 09:34:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 09:34:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-06-22 09:34:33,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2020-06-22 09:34:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:33,973 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 09:34:33,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:34:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-06-22 09:34:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 09:34:33,974 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:33,974 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:33,974 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1513783671, now seen corresponding path program 1 times [2020-06-22 09:34:33,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:33,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:34,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:34,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:34,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:34,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 09:34:34,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:34,177 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 09:34:34,178 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:34,188 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:34,189 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:34,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 09:34:34,354 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:34,355 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 51 [2020-06-22 09:34:34,366 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:34:34,481 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-06-22 09:34:34,482 INFO L497 ElimStorePlain]: treesize reduction 8, result has 90.0 percent of original size [2020-06-22 09:34:34,484 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:34,485 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:72 [2020-06-22 09:34:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:34,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:34:34,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:34:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:34:34,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:34:34,903 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 17 states. [2020-06-22 09:34:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:35,728 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-06-22 09:34:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 09:34:35,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-06-22 09:34:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:35,729 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:34:35,729 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 09:34:35,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2020-06-22 09:34:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 09:34:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-06-22 09:34:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 09:34:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-06-22 09:34:35,734 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 18 [2020-06-22 09:34:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:35,734 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-06-22 09:34:35,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:34:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-06-22 09:34:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 09:34:35,735 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:35,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:35,735 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 25378699, now seen corresponding path program 2 times [2020-06-22 09:34:35,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:35,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:35,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:35,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:35,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:35,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:35,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:35,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:34:36,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:34:36,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:34:36,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 09:34:36,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:36,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:36,012 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:34:36,012 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:36,024 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:36,025 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:36,025 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-06-22 09:34:36,052 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:34:36,052 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:36,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:36,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:36,066 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 09:34:36,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:36,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 09:34:36,108 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:36,121 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:36,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:36,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-06-22 09:34:36,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:36,186 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:36,186 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 09:34:36,188 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:34:36,203 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:36,204 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:36,204 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:27 [2020-06-22 09:34:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:34:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-06-22 09:34:36,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:34:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:34:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:34:36,316 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 15 states. [2020-06-22 09:34:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:38,127 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2020-06-22 09:34:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-06-22 09:34:38,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-06-22 09:34:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:38,128 INFO L225 Difference]: With dead ends: 77 [2020-06-22 09:34:38,128 INFO L226 Difference]: Without dead ends: 76 [2020-06-22 09:34:38,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2020-06-22 09:34:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-06-22 09:34:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2020-06-22 09:34:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 09:34:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2020-06-22 09:34:38,137 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 21 [2020-06-22 09:34:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:38,137 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2020-06-22 09:34:38,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:34:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2020-06-22 09:34:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-06-22 09:34:38,138 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:38,138 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:38,139 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 63207988, now seen corresponding path program 2 times [2020-06-22 09:34:38,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:38,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:38,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:38,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:38,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:38,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:34:38,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:34:38,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:34:38,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 09:34:38,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:38,498 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:38,498 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:34:38,499 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:38,518 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 09:34:38,519 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:38,519 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 09:34:38,543 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 09:34:38,543 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:38,550 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:38,551 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:38,551 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 09:34:38,698 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:38,698 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 [2020-06-22 09:34:38,705 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:34:38,743 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:38,745 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:38,746 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:82 [2020-06-22 09:34:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:34:38,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:38,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:34:38,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:34:38,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:34:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:34:38,877 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 17 states. [2020-06-22 09:34:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:46,266 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2020-06-22 09:34:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-06-22 09:34:46,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2020-06-22 09:34:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:46,267 INFO L225 Difference]: With dead ends: 127 [2020-06-22 09:34:46,267 INFO L226 Difference]: Without dead ends: 121 [2020-06-22 09:34:46,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=657, Invalid=1792, Unknown=1, NotChecked=0, Total=2450 [2020-06-22 09:34:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-06-22 09:34:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 79. [2020-06-22 09:34:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-06-22 09:34:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-06-22 09:34:46,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 25 [2020-06-22 09:34:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:46,277 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-06-22 09:34:46,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:34:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-06-22 09:34:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-06-22 09:34:46,278 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:46,279 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:46,279 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash -688351614, now seen corresponding path program 1 times [2020-06-22 09:34:46,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:46,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 09:34:46,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:46,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:46,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:46,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:34:46,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:46,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:46,442 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 09:34:46,442 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,451 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:46,452 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,452 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 09:34:46,475 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:34:46,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,482 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:46,483 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,483 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-06-22 09:34:46,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:46,507 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 09:34:46,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,515 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:46,516 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:46,516 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2020-06-22 09:34:46,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 09:34:46,562 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:46,563 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 09:34:46,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:34:46,575 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:46,576 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:46,576 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2020-06-22 09:34:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 09:34:46,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:46,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-06-22 09:34:46,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:34:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:34:46,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:34:46,688 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 15 states. [2020-06-22 09:34:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:47,339 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2020-06-22 09:34:47,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 09:34:47,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2020-06-22 09:34:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:47,340 INFO L225 Difference]: With dead ends: 85 [2020-06-22 09:34:47,340 INFO L226 Difference]: Without dead ends: 84 [2020-06-22 09:34:47,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:34:47,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-06-22 09:34:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 41. [2020-06-22 09:34:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 09:34:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-06-22 09:34:47,347 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 28 [2020-06-22 09:34:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:47,347 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-06-22 09:34:47,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:34:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-06-22 09:34:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-06-22 09:34:47,348 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:34:47,348 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:47,348 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 09:34:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash -533234261, now seen corresponding path program 1 times [2020-06-22 09:34:47,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:47,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:47,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:47,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 09:34:47,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:34:47,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:34:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:47,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:34:47,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:47,578 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:47,579 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 09:34:47,579 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:47,604 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 09:34:47,605 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:47,605 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 09:34:47,610 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 09:34:47,611 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:34:47,613 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:47,613 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:34:47,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 09:34:47,711 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:47,712 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 55 [2020-06-22 09:34:47,718 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:34:47,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:34:47,754 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 09:34:47,754 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:76 [2020-06-22 09:34:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 09:34:47,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:34:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-06-22 09:34:47,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:34:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:34:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:34:47,860 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 15 states. [2020-06-22 09:34:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:48,328 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-06-22 09:34:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 09:34:48,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2020-06-22 09:34:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:34:48,329 INFO L225 Difference]: With dead ends: 51 [2020-06-22 09:34:48,329 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:34:48,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2020-06-22 09:34:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:34:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:34:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:34:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:34:48,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-06-22 09:34:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:34:48,330 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:48,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:34:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:34:48,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:34:48,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:34:48,468 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 207 [2020-06-22 09:34:49,563 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 207 DAG size of output: 79 [2020-06-22 09:34:49,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 40) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,567 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,568 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,568 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,568 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,568 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 18) no Hoare annotation was computed. [2020-06-22 09:34:49,568 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 15 18) the Hoare annotation is: (let ((.cse20 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse19 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse18 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse21 (select |#length| ULTIMATE.start_cstrcmp_~s1.base))) (let ((.cse13 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse3 (<= 1 .cse21)) (.cse8 (= ULTIMATE.start_cstrcmp_~s2.offset 0)) (.cse1 (= (select |#valid| ULTIMATE.start_cstrcmp_~s2.base) 1)) (.cse4 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse2 (= ULTIMATE.start_main_~length1~0 .cse22)) (.cse6 (= (select |#valid| ULTIMATE.start_cstrcmp_~s1.base) 1)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse9 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))) 0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse10 (= 0 (select .cse18 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse22 (- 1))))) (.cse11 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse12 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse0 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse14 (= 0 (select .cse19 (+ .cse21 (- 1))))) (.cse16 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse17 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse20))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (and .cse1 .cse2 .cse12 .cse13 (= 0 (select .cse18 ULTIMATE.start_main_~nondetString1~0.offset)) .cse16 .cse15 .cse3 (= 1 ULTIMATE.start_main_~length1~0) .cse8 (= 0 (select .cse19 ULTIMATE.start_cstrcmp_~s1.offset)) .cse5 .cse11 .cse0 (<= 1 .cse20) .cse6 .cse7) (and (and (and .cse1 .cse4 .cse5 .cse2 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse6 .cse7 .cse15) .cse9 .cse10 (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse21) .cse11 .cse12 .cse0 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) .cse14) .cse16 .cse17)))) [2020-06-22 09:34:49,568 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 18) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:34:49,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 09:34:49,570 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 09:34:49,570 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:34:49,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,590 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,592 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,593 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,594 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:49,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:49,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:49,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:49 BasicIcfg [2020-06-22 09:34:49,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:34:49,617 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:34:49,617 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:34:49,621 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:34:49,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:49,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:34:26" (1/5) ... [2020-06-22 09:34:49,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a177572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:34:49, skipping insertion in model container [2020-06-22 09:34:49,622 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:49,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:34:26" (2/5) ... [2020-06-22 09:34:49,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a177572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:34:49, skipping insertion in model container [2020-06-22 09:34:49,623 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:49,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:34:27" (3/5) ... [2020-06-22 09:34:49,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a177572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:49, skipping insertion in model container [2020-06-22 09:34:49,623 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:49,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:34:27" (4/5) ... [2020-06-22 09:34:49,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a177572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:49, skipping insertion in model container [2020-06-22 09:34:49,624 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:34:49,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:34:49" (5/5) ... [2020-06-22 09:34:49,625 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:34:49,645 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:34:49,646 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:34:49,646 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:34:49,646 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:34:49,646 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:34:49,646 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:34:49,646 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:34:49,646 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:34:49,646 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:34:49,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-06-22 09:34:49,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:49,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:49,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:49,659 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:49,659 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:34:49,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:34:49,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2020-06-22 09:34:49,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:49,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:49,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:49,661 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:49,661 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:34:49,666 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 6#L29true [116] L29-->L29-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[] 4#L29-2true [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 8#L32-1true [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 14#L37true [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 31#L37-1true [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 5#L15-9true [2020-06-22 09:34:49,666 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-9true [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 30#L15-1true [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 28#L15-2true [111] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short3_5|) InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} AuxVars[] AssignedVars[] 7#L15-7true [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 5#L15-9true [2020-06-22 09:34:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 1 times [2020-06-22 09:34:49,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 3430452, now seen corresponding path program 1 times [2020-06-22 09:34:49,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:34:49,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:34:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:49,707 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-06-22 09:34:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:49,779 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. [2020-06-22 09:34:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:49,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 55 transitions. [2020-06-22 09:34:49,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:34:49,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 15 states and 25 transitions. [2020-06-22 09:34:49,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 09:34:49,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 09:34:49,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 25 transitions. [2020-06-22 09:34:49,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:34:49,786 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 25 transitions. [2020-06-22 09:34:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 25 transitions. [2020-06-22 09:34:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-06-22 09:34:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:34:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-06-22 09:34:49,788 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 09:34:49,788 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-06-22 09:34:49,788 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:34:49,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 24 transitions. [2020-06-22 09:34:49,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:34:49,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:49,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:49,789 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:49,789 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:34:49,790 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 75#L29 [116] L29-->L29-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[] 71#L29-2 [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 72#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 69#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 70#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 73#L15-9 [2020-06-22 09:34:49,790 INFO L796 eck$LassoCheckResult]: Loop: 73#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 74#L15-1 [157] L15-1-->L15-2: Formula: (and (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) (not |v_ULTIMATE.start_cstrcmp_#t~short3_2|)) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 82#L15-2 [111] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short3_5|) InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_5|} AuxVars[] AssignedVars[] 76#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 73#L15-9 [2020-06-22 09:34:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 2 times [2020-06-22 09:34:49,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 3431413, now seen corresponding path program 1 times [2020-06-22 09:34:49,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:49,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:49,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:34:49,811 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:34:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:34:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:34:49,811 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 09:34:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:49,840 INFO L93 Difference]: Finished difference Result 15 states and 23 transitions. [2020-06-22 09:34:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:34:49,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2020-06-22 09:34:49,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:49,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2020-06-22 09:34:49,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:34:49,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:34:49,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-06-22 09:34:49,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:34:49,842 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 09:34:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-06-22 09:34:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 09:34:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:34:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-06-22 09:34:49,843 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 09:34:49,843 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 09:34:49,843 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:34:49,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-06-22 09:34:49,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:49,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:49,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:49,845 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:49,845 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:49,845 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 110#L29 [116] L29-->L29-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[] 106#L29-2 [75] L29-2-->L32-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 107#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 104#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 105#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 108#L15-9 [2020-06-22 09:34:49,846 INFO L796 eck$LassoCheckResult]: Loop: 108#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 109#L15-1 [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 116#L15-2 [110] L15-2-->L15-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short3_3| InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} AuxVars[] AssignedVars[] 115#L15-3 [107] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem1_2|) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s1.base_6) 1)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_2|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem1] 114#L15-4 [101] L15-4-->L15-5: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_3 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_3) v_ULTIMATE.start_cstrcmp_~s2.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 112#L15-5 [173] L15-5-->L15-7: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short3_4| (= |v_ULTIMATE.start_cstrcmp_#t~mem1_3| |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_4|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 111#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 108#L15-9 [2020-06-22 09:34:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1740766361, now seen corresponding path program 3 times [2020-06-22 09:34:49,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -882785182, now seen corresponding path program 1 times [2020-06-22 09:34:49,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1369510710, now seen corresponding path program 1 times [2020-06-22 09:34:49,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:49,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:34:49,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 09:34:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:34:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:34:50,020 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 7 Second operand 9 states. [2020-06-22 09:34:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:34:50,178 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-06-22 09:34:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:34:50,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2020-06-22 09:34:50,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:50,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 13 states and 18 transitions. [2020-06-22 09:34:50,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:34:50,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:34:50,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-06-22 09:34:50,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:34:50,181 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:34:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-06-22 09:34:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 09:34:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:34:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 09:34:50,182 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:34:50,182 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:34:50,182 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:34:50,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 09:34:50,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:34:50,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:34:50,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:34:50,183 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:34:50,183 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:34:50,184 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY [176] ULTIMATE.startENTRY-->L29: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 169#L29 [116] L29-->L29-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[] 165#L29-2 [117] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 166#L32-1 [139] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 163#L37 [93] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |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))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 164#L37-1 [177] L37-1-->L15-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (<= 1 .cse0) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_4|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_10|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_6|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_4|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_#t~ite8=|v_ULTIMATE.start_cstrcmp_#t~ite8_6|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_4|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~ite8, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_~uc1~0] 167#L15-9 [2020-06-22 09:34:50,184 INFO L796 eck$LassoCheckResult]: Loop: 167#L15-9 [79] L15-9-->L15-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_2|, #length=|v_#length_8|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem0] 168#L15-1 [156] L15-1-->L15-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem0_3|) |v_ULTIMATE.start_cstrcmp_#t~short3_2|) InVars {ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 175#L15-2 [110] L15-2-->L15-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short3_3| InVars {ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_3|} AuxVars[] AssignedVars[] 174#L15-3 [107] L15-3-->L15-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem1_2|) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s1.base_6) 1)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_15|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_2|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem1] 173#L15-4 [101] L15-4-->L15-5: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_3 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s2.base_3)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_3) v_ULTIMATE.start_cstrcmp_~s2.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_3, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_3, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 171#L15-5 [173] L15-5-->L15-7: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short3_4| (= |v_ULTIMATE.start_cstrcmp_#t~mem1_3| |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_3|, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_4|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short3] 170#L15-7 [85] L15-7-->L15-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) |v_ULTIMATE.start_cstrcmp_#t~short3_9| (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_6 1) v_ULTIMATE.start_cstrcmp_~s2.offset_5) (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10) (= v_ULTIMATE.start_cstrcmp_~s2.base_7 v_ULTIMATE.start_cstrcmp_~s2.base_6)) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post4.offset=|v_ULTIMATE.start_cstrcmp_#t~post4.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_5, ULTIMATE.start_cstrcmp_#t~short3=|v_ULTIMATE.start_cstrcmp_#t~short3_8|, ULTIMATE.start_cstrcmp_#t~post5.offset=|v_ULTIMATE.start_cstrcmp_#t~post5.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_#t~mem0=|v_ULTIMATE.start_cstrcmp_#t~mem0_5|, ULTIMATE.start_cstrcmp_#t~post5.base=|v_ULTIMATE.start_cstrcmp_#t~post5.base_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post4.base=|v_ULTIMATE.start_cstrcmp_#t~post4.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post4.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~short3, ULTIMATE.start_cstrcmp_#t~post4.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post5.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~mem0, ULTIMATE.start_cstrcmp_#t~post5.base, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2] 167#L15-9 [2020-06-22 09:34:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1742017583, now seen corresponding path program 1 times [2020-06-22 09:34:50,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:50,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash -882785182, now seen corresponding path program 2 times [2020-06-22 09:34:50,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:50,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:34:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 467943540, now seen corresponding path program 1 times [2020-06-22 09:34:50,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:34:50,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:34:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:34:50,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:34:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:34:50,494 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 09:34:50,601 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:34:50,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:34:50,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:34:50,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:34:50,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:34:50,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:34:50,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:34:50,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:34:50,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:34:50,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:34:50,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:34:50,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:50,912 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-06-22 09:34:51,039 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 09:34:51,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,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 09:34:51,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:34:51,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 09:34:51,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:34:51,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:34:51,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:34:51,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:34:51,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:34:51,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:34:51,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:34:51,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:34:51,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:34:51,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:34:51,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:34:51,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:34:51,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:34:51,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:34:51,667 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 09:34:51,667 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 09:34:51,670 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:34:51,671 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:34:51,671 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:34:51,672 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset Supporting invariants [] [2020-06-22 09:34:51,718 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 09:34:51,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:34:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:51,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 09:34:51,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:51,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:34:51,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:34:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:51,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:34:51,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:34:51,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:34:51,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:34:52,025 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 09:34:52,030 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2020-06-22 09:34:52,031 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 09:34:52,273 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 28 states and 37 transitions. Complement of second has 8 states. [2020-06-22 09:34:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 09:34:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:34:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-06-22 09:34:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 6 letters. Loop has 7 letters. [2020-06-22 09:34:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 13 letters. Loop has 7 letters. [2020-06-22 09:34:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 6 letters. Loop has 14 letters. [2020-06-22 09:34:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:34:52,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2020-06-22 09:34:52,293 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:34:52,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-06-22 09:34:52,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:34:52,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:34:52,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:34:52,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:34:52,294 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:52,294 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:52,294 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:34:52,294 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:34:52,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:34:52,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:34:52,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:34:52,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:34:52 BasicIcfg [2020-06-22 09:34:52,301 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:34:52,301 INFO L168 Benchmark]: Toolchain (without parser) took 25867.97 ms. Allocated memory was 649.6 MB in the beginning and 936.9 MB in the end (delta: 287.3 MB). Free memory was 565.2 MB in the beginning and 861.1 MB in the end (delta: -295.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:52,302 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 591.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:52,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.59 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.2 MB in the beginning and 664.0 MB in the end (delta: -98.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 700.4 MB. Free memory was 664.0 MB in the beginning and 661.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,303 INFO L168 Benchmark]: Boogie Preprocessor took 26.22 ms. Allocated memory is still 700.4 MB. Free memory was 661.8 MB in the beginning and 659.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,303 INFO L168 Benchmark]: RCFGBuilder took 364.61 ms. Allocated memory is still 700.4 MB. Free memory was 659.6 MB in the beginning and 635.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,304 INFO L168 Benchmark]: BlockEncodingV2 took 132.51 ms. Allocated memory is still 700.4 MB. Free memory was 635.3 MB in the beginning and 625.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,304 INFO L168 Benchmark]: TraceAbstraction took 22300.53 ms. Allocated memory was 700.4 MB in the beginning and 904.4 MB in the end (delta: 203.9 MB). Free memory was 625.6 MB in the beginning and 411.8 MB in the end (delta: 213.8 MB). Peak memory consumption was 417.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:34:52,305 INFO L168 Benchmark]: BuchiAutomizer took 2683.33 ms. Allocated memory was 904.4 MB in the beginning and 936.9 MB in the end (delta: 32.5 MB). Free memory was 411.8 MB in the beginning and 861.1 MB in the end (delta: -449.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:34:52,308 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 39 locations, 44 edges - StatisticsResult: Encoded RCFG 29 locations, 53 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 591.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.59 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.2 MB in the beginning and 664.0 MB in the end (delta: -98.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 700.4 MB. Free memory was 664.0 MB in the beginning and 661.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.22 ms. Allocated memory is still 700.4 MB. Free memory was 661.8 MB in the beginning and 659.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 364.61 ms. Allocated memory is still 700.4 MB. Free memory was 659.6 MB in the beginning and 635.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 132.51 ms. Allocated memory is still 700.4 MB. Free memory was 635.3 MB in the beginning and 625.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 22300.53 ms. Allocated memory was 700.4 MB in the beginning and 904.4 MB in the end (delta: 203.9 MB). Free memory was 625.6 MB in the beginning and 411.8 MB in the end (delta: 213.8 MB). Peak memory consumption was 417.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2683.33 ms. Allocated memory was 904.4 MB in the beginning and 936.9 MB in the end (delta: 32.5 MB). Free memory was 411.8 MB in the beginning and 861.1 MB in the end (delta: -449.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 09:34:52,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 09:34:52,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:34:52,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:34:52,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((nondetString2 == 0 && (((((((((((((\valid[s2] == 1 && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[s1]) && 1 <= length1) && 1 == \valid[nondetString1]) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && s2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && s1 == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && 1 <= length2) && unknown-#length-unknown[nondetString2] == length2) && s2 + 1 <= unknown-#length-unknown[s2]) || ((((((((((((((((\valid[s2] == 1 && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && s1 == 0) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && 1 == length1) && s2 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 <= unknown-#length-unknown[s2]) && \valid[s1] == 1) && 1 == \valid[nondetString2])) || (((((((((((((((((\valid[s2] == 1 && 1 <= length1) && 1 == \valid[nondetString1]) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= s1) && \valid[s1] == 1) && 1 == \valid[nondetString2]) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0 && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && s1 + 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && 1 <= s2) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && unknown-#length-unknown[nondetString2] == length2) && s2 + 1 <= unknown-#length-unknown[s2]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 14 error locations. SAFE Result, 22.1s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 2172 SDslu, 771 SDs, 0 SdLazy, 2134 SolverSat, 283 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 167 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 333 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1139 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 3766 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 432 ConstructedInterpolants, 52 QuantifiedInterpolants, 103140 SizeOfPredicates, 80 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 55/199 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 (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 148 SDslu, 146 SDs, 0 SdLazy, 291 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax100 hnf100 lsp97 ukn86 mio100 lsp47 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:34:23.190 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:34:52.567 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check