/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:12:51,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:12:51,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:12:51,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:12:51,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:12:51,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:12:51,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:12:51,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:12:51,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:12:51,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:12:51,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:12:51,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:12:51,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:12:51,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:12:51,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:12:51,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:12:51,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:12:51,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:12:51,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:12:51,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:12:51,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:12:51,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:12:51,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:12:51,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:12:51,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:12:51,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:12:51,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:12:51,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:12:51,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:12:51,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:12:51,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:12:51,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:12:51,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:12:51,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:12:51,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:12:51,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:12:51,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:12:51,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:12:51,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:12:51,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:12:51,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:12:51,628 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:12:51,642 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:12:51,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:12:51,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:12:51,643 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:12:51,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:12:51,644 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:12:51,644 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:12:51,644 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:12:51,644 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:12:51,644 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:12:51,645 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:12:51,645 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:12:51,645 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:12:51,645 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:12:51,645 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:12:51,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:12:51,646 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:12:51,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:12:51,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:12:51,646 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:12:51,646 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:12:51,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:12:51,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:12:51,647 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:12:51,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:12:51,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:12:51,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:12:51,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:12:51,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:12:51,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:12:51,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:12:51,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:12:51,831 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:12:51,831 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:12:51,832 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:12:51,889 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_XSKbyf/tmp/d8b9c84e5459427fbe404d593503df25/FLAGb140b42cf [2020-07-01 13:12:52,226 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:12:52,227 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:12:52,227 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:12:52,234 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_XSKbyf/tmp/d8b9c84e5459427fbe404d593503df25/FLAGb140b42cf [2020-07-01 13:12:52,643 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_XSKbyf/tmp/d8b9c84e5459427fbe404d593503df25 [2020-07-01 13:12:52,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:12:52,656 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:12:52,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:12:52,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:12:52,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:12:52,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:52,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c55f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52, skipping insertion in model container [2020-07-01 13:12:52,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:52,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:12:52,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:12:52,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:12:52,941 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:12:52,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:12:52,976 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:12:52,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52 WrapperNode [2020-07-01 13:12:52,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:12:52,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:12:52,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:12:52,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:12:52,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:52,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:12:53,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:12:53,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:12:53,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:12:53,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... [2020-07-01 13:12:53,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:12:53,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:12:53,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:12:53,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:12:53,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:12:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:12:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:12:53,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:12:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:12:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:12:53,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:12:53,411 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:12:53,411 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:12:53,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:53 BoogieIcfgContainer [2020-07-01 13:12:53,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:12:53,416 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:12:53,416 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:12:53,419 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:12:53,420 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,436 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 44 edges [2020-07-01 13:12:53,440 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:12:53,441 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:12:53,441 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:12:53,442 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:12:53,444 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:12:53,445 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:12:53,445 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:12:53,470 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:12:53,501 INFO L200 BlockEncoder]: SBE split 19 edges [2020-07-01 13:12:53,506 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:12:53,507 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:12:53,526 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-07-01 13:12:53,529 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 13:12:53,530 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:12:53,530 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:12:53,531 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:12:53,531 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:12:53,532 INFO L313 BlockEncoder]: Encoded RCFG 31 locations, 57 edges [2020-07-01 13:12:53,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:53 BasicIcfg [2020-07-01 13:12:53,532 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:12:53,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:12:53,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:12:53,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:12:53,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:12:52" (1/4) ... [2020-07-01 13:12:53,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d89074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:12:53, skipping insertion in model container [2020-07-01 13:12:53,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (2/4) ... [2020-07-01 13:12:53,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d89074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:12:53, skipping insertion in model container [2020-07-01 13:12:53,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:53" (3/4) ... [2020-07-01 13:12:53,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d89074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:53, skipping insertion in model container [2020-07-01 13:12:53,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:53" (4/4) ... [2020-07-01 13:12:53,541 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:12:53,552 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:12:53,559 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 13:12:53,573 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 13:12:53,596 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:12:53,596 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:12:53,596 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:12:53,597 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:12:53,597 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:12:53,597 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:12:53,597 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:12:53,597 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:12:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-01 13:12:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:53,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:53,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:53,620 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:53,626 INFO L82 PathProgramCache]: Analyzing trace with hash 200279767, now seen corresponding path program 1 times [2020-07-01 13:12:53,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:53,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883950438] [2020-07-01 13:12:53,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:53,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883950438] [2020-07-01 13:12:53,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:53,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:53,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555974683] [2020-07-01 13:12:53,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:53,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:53,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:53,819 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-07-01 13:12:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:53,947 INFO L93 Difference]: Finished difference Result 58 states and 105 transitions. [2020-07-01 13:12:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:53,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:12:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:53,962 INFO L225 Difference]: With dead ends: 58 [2020-07-01 13:12:53,963 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:12:53,966 INFO L675 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-07-01 13:12:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:12:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:12:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:12:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-07-01 13:12:54,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 5 [2020-07-01 13:12:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,007 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-07-01 13:12:54,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-07-01 13:12:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:54,008 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:54,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:12:54,010 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,010 INFO L82 PathProgramCache]: Analyzing trace with hash 200279829, now seen corresponding path program 1 times [2020-07-01 13:12:54,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633607620] [2020-07-01 13:12:54,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633607620] [2020-07-01 13:12:54,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231254687] [2020-07-01 13:12:54,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,064 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-07-01 13:12:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,151 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-07-01 13:12:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:12:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,153 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:12:54,153 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:12:54,154 INFO L675 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-07-01 13:12:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:12:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:12:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:12:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 52 transitions. [2020-07-01 13:12:54,159 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 52 transitions. Word has length 5 [2020-07-01 13:12:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,159 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 52 transitions. [2020-07-01 13:12:54,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2020-07-01 13:12:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:54,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:54,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:12:54,161 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 200279831, now seen corresponding path program 1 times [2020-07-01 13:12:54,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933915847] [2020-07-01 13:12:54,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933915847] [2020-07-01 13:12:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696615376] [2020-07-01 13:12:54,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,214 INFO L87 Difference]: Start difference. First operand 30 states and 52 transitions. Second operand 3 states. [2020-07-01 13:12:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,287 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2020-07-01 13:12:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:12:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,288 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:12:54,288 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:12:54,289 INFO L675 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-07-01 13:12:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:12:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:12:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:12:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2020-07-01 13:12:54,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 5 [2020-07-01 13:12:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,294 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2020-07-01 13:12:54,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2020-07-01 13:12:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:54,294 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:54,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:12:54,295 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 200279832, now seen corresponding path program 1 times [2020-07-01 13:12:54,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132628459] [2020-07-01 13:12:54,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132628459] [2020-07-01 13:12:54,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:54,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845054967] [2020-07-01 13:12:54,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:54,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:54,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:12:54,341 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 4 states. [2020-07-01 13:12:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,412 INFO L93 Difference]: Finished difference Result 30 states and 51 transitions. [2020-07-01 13:12:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:54,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:12:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,413 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:12:54,413 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:12:54,413 INFO L675 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-07-01 13:12:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:12:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 13:12:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 13:12:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2020-07-01 13:12:54,418 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 50 transitions. Word has length 5 [2020-07-01 13:12:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,418 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 50 transitions. [2020-07-01 13:12:54,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 50 transitions. [2020-07-01 13:12:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:12:54,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:12:54,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:12:54,419 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1913706466, now seen corresponding path program 1 times [2020-07-01 13:12:54,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110085256] [2020-07-01 13:12:54,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110085256] [2020-07-01 13:12:54,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144811508] [2020-07-01 13:12:54,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,451 INFO L87 Difference]: Start difference. First operand 29 states and 50 transitions. Second operand 3 states. [2020-07-01 13:12:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,517 INFO L93 Difference]: Finished difference Result 29 states and 50 transitions. [2020-07-01 13:12:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:12:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,518 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:12:54,518 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:12:54,519 INFO L675 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-07-01 13:12:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:12:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:12:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:12:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2020-07-01 13:12:54,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 6 [2020-07-01 13:12:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,523 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-07-01 13:12:54,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2020-07-01 13:12:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:12:54,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:12:54,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:12:54,525 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1913706468, now seen corresponding path program 1 times [2020-07-01 13:12:54,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015086145] [2020-07-01 13:12:54,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015086145] [2020-07-01 13:12:54,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85057458] [2020-07-01 13:12:54,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,565 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand 3 states. [2020-07-01 13:12:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,658 INFO L93 Difference]: Finished difference Result 29 states and 48 transitions. [2020-07-01 13:12:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:12:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,660 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:12:54,660 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:12:54,660 INFO L675 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-07-01 13:12:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:12:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:12:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:12:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2020-07-01 13:12:54,665 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 6 [2020-07-01 13:12:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,665 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. [2020-07-01 13:12:54,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2020-07-01 13:12:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:12:54,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:12:54,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:12:54,666 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1913706469, now seen corresponding path program 1 times [2020-07-01 13:12:54,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486173982] [2020-07-01 13:12:54,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486173982] [2020-07-01 13:12:54,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:54,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856954364] [2020-07-01 13:12:54,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:54,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:12:54,709 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. [2020-07-01 13:12:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,771 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-07-01 13:12:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:54,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 13:12:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,772 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:12:54,772 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:12:54,773 INFO L675 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-07-01 13:12:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:12:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:12:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:12:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-07-01 13:12:54,777 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 6 [2020-07-01 13:12:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,777 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-07-01 13:12:54,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-07-01 13:12:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:12:54,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:54,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:12:54,779 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -804640461, now seen corresponding path program 1 times [2020-07-01 13:12:54,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128721094] [2020-07-01 13:12:54,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128721094] [2020-07-01 13:12:54,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:54,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842435269] [2020-07-01 13:12:54,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:54,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:12:54,823 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2020-07-01 13:12:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,899 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-07-01 13:12:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:54,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:12:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,900 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:12:54,900 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:12:54,901 INFO L675 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-07-01 13:12:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:12:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 13:12:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 13:12:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2020-07-01 13:12:54,905 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 7 [2020-07-01 13:12:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,905 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2020-07-01 13:12:54,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2020-07-01 13:12:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:12:54,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:54,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:12:54,906 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -804640459, now seen corresponding path program 1 times [2020-07-01 13:12:54,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712099430] [2020-07-01 13:12:54,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712099430] [2020-07-01 13:12:54,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:12:54,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928433798] [2020-07-01 13:12:54,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:12:54,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:12:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:12:54,967 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2020-07-01 13:12:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,109 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2020-07-01 13:12:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:12:55,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 13:12:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,111 INFO L225 Difference]: With dead ends: 44 [2020-07-01 13:12:55,111 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 13:12:55,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:12:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 13:12:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-01 13:12:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 13:12:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 68 transitions. [2020-07-01 13:12:55,117 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 68 transitions. Word has length 7 [2020-07-01 13:12:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,117 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 68 transitions. [2020-07-01 13:12:55,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:12:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 68 transitions. [2020-07-01 13:12:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:12:55,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:12:55,119 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -833066148, now seen corresponding path program 1 times [2020-07-01 13:12:55,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940636155] [2020-07-01 13:12:55,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940636155] [2020-07-01 13:12:55,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558969131] [2020-07-01 13:12:55,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,159 INFO L87 Difference]: Start difference. First operand 35 states and 68 transitions. Second operand 3 states. [2020-07-01 13:12:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,221 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2020-07-01 13:12:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:12:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,222 INFO L225 Difference]: With dead ends: 35 [2020-07-01 13:12:55,223 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:12:55,223 INFO L675 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-07-01 13:12:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:12:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:12:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:12:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-07-01 13:12:55,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 10 [2020-07-01 13:12:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,228 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-07-01 13:12:55,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. [2020-07-01 13:12:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:12:55,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:12:55,229 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash -833066146, now seen corresponding path program 1 times [2020-07-01 13:12:55,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251475315] [2020-07-01 13:12:55,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251475315] [2020-07-01 13:12:55,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:55,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281529610] [2020-07-01 13:12:55,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:55,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:55,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:12:55,265 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 4 states. [2020-07-01 13:12:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,339 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-01 13:12:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:55,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:12:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,340 INFO L225 Difference]: With dead ends: 50 [2020-07-01 13:12:55,340 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 13:12:55,341 INFO L675 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-07-01 13:12:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 13:12:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-07-01 13:12:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:12:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-07-01 13:12:55,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 10 [2020-07-01 13:12:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,347 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-07-01 13:12:55,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-07-01 13:12:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:12:55,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:12:55,348 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash -833066145, now seen corresponding path program 1 times [2020-07-01 13:12:55,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715589044] [2020-07-01 13:12:55,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715589044] [2020-07-01 13:12:55,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:12:55,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702127409] [2020-07-01 13:12:55,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:12:55,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:12:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:12:55,416 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 5 states. [2020-07-01 13:12:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,521 INFO L93 Difference]: Finished difference Result 47 states and 80 transitions. [2020-07-01 13:12:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:12:55,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 13:12:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,522 INFO L225 Difference]: With dead ends: 47 [2020-07-01 13:12:55,522 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:12:55,523 INFO L675 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-07-01 13:12:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:12:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-01 13:12:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:12:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. [2020-07-01 13:12:55,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 10 [2020-07-01 13:12:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,528 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. [2020-07-01 13:12:55,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:12:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. [2020-07-01 13:12:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 13:12:55,529 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:12:55,529 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1701256715, now seen corresponding path program 1 times [2020-07-01 13:12:55,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227579296] [2020-07-01 13:12:55,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227579296] [2020-07-01 13:12:55,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:55,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862137815] [2020-07-01 13:12:55,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,556 INFO L87 Difference]: Start difference. First operand 40 states and 71 transitions. Second operand 3 states. [2020-07-01 13:12:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,609 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2020-07-01 13:12:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 13:12:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,610 INFO L225 Difference]: With dead ends: 75 [2020-07-01 13:12:55,610 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 13:12:55,611 INFO L675 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-07-01 13:12:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 13:12:55,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-01 13:12:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:12:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2020-07-01 13:12:55,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 15 [2020-07-01 13:12:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,617 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2020-07-01 13:12:55,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2020-07-01 13:12:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 13:12:55,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:12:55,618 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -850900246, now seen corresponding path program 1 times [2020-07-01 13:12:55,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757545600] [2020-07-01 13:12:55,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757545600] [2020-07-01 13:12:55,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:12:55,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624634564] [2020-07-01 13:12:55,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,645 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand 3 states. [2020-07-01 13:12:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,686 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-07-01 13:12:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 13:12:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,687 INFO L225 Difference]: With dead ends: 81 [2020-07-01 13:12:55,687 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 13:12:55,687 INFO L675 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-07-01 13:12:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 13:12:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-01 13:12:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 13:12:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2020-07-01 13:12:55,692 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 15 [2020-07-01 13:12:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,692 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2020-07-01 13:12:55,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-01 13:12:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 13:12:55,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:12:55,693 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 902510982, now seen corresponding path program 1 times [2020-07-01 13:12:55,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069135818] [2020-07-01 13:12:55,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069135818] [2020-07-01 13:12:55,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-01 13:12:55,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462915448] [2020-07-01 13:12:55,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 13:12:55,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 13:12:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-01 13:12:55,811 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand 9 states. [2020-07-01 13:12:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:56,084 INFO L93 Difference]: Finished difference Result 103 states and 161 transitions. [2020-07-01 13:12:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:12:56,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-07-01 13:12:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:56,085 INFO L225 Difference]: With dead ends: 103 [2020-07-01 13:12:56,086 INFO L226 Difference]: Without dead ends: 85 [2020-07-01 13:12:56,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-07-01 13:12:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-01 13:12:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 54. [2020-07-01 13:12:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 13:12:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2020-07-01 13:12:56,092 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 17 [2020-07-01 13:12:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:56,092 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2020-07-01 13:12:56,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 13:12:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2020-07-01 13:12:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 13:12:56,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:56,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:56,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 13:12:56,094 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 847353067, now seen corresponding path program 1 times [2020-07-01 13:12:56,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:56,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241516041] [2020-07-01 13:12:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:56,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241516041] [2020-07-01 13:12:56,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:56,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:12:56,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16224787] [2020-07-01 13:12:56,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 13:12:56,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 13:12:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:12:56,207 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand 7 states. [2020-07-01 13:12:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:56,363 INFO L93 Difference]: Finished difference Result 107 states and 160 transitions. [2020-07-01 13:12:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:12:56,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-01 13:12:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:56,364 INFO L225 Difference]: With dead ends: 107 [2020-07-01 13:12:56,364 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 13:12:56,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-07-01 13:12:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 13:12:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-01 13:12:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 13:12:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2020-07-01 13:12:56,370 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 17 [2020-07-01 13:12:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:56,370 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2020-07-01 13:12:56,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 13:12:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2020-07-01 13:12:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 13:12:56,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:56,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:56,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 13:12:56,372 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash -173715287, now seen corresponding path program 1 times [2020-07-01 13:12:56,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:56,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141045872] [2020-07-01 13:12:56,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:56,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141045872] [2020-07-01 13:12:56,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724035285] [2020-07-01 13:12:56,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:56,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 13:12:56,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:12:56,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:12:56,784 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:56,790 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:56,790 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:56,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-07-01 13:12:56,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:12:56,820 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:56,828 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:56,830 INFO L539 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-07-01 13:12:56,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-07-01 13:12:56,887 INFO L377 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-07-01 13:12:56,888 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:56,902 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:56,906 INFO L539 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-07-01 13:12:56,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2020-07-01 13:12:56,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:56,967 INFO L377 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 28 treesize of output 21 [2020-07-01 13:12:56,969 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:56,972 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:12:56,986 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:56,989 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:12:56,992 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:12:56,994 INFO L539 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 13:12:56,994 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:27 [2020-07-01 13:12:57,027 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:57,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:12:57,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 13:12:57,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890056942] [2020-07-01 13:12:57,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 13:12:57,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 13:12:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-01 13:12:57,068 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand 15 states. [2020-07-01 13:12:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:59,129 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2020-07-01 13:12:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 13:12:59,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-07-01 13:12:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:59,131 INFO L225 Difference]: With dead ends: 97 [2020-07-01 13:12:59,131 INFO L226 Difference]: Without dead ends: 95 [2020-07-01 13:12:59,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-01 13:12:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-01 13:12:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2020-07-01 13:12:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 13:12:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2020-07-01 13:12:59,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 17 [2020-07-01 13:12:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:59,139 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-07-01 13:12:59,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 13:12:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2020-07-01 13:12:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 13:12:59,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:59,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:59,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-01 13:12:59,341 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash -173715286, now seen corresponding path program 1 times [2020-07-01 13:12:59,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:59,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112337998] [2020-07-01 13:12:59,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:59,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112337998] [2020-07-01 13:12:59,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820499590] [2020-07-01 13:12:59,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:59,444 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:12:59,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:12:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:59,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:12:59,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:12:59,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863141787] [2020-07-01 13:12:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:59,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:12:59,456 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand 4 states. [2020-07-01 13:12:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:59,530 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2020-07-01 13:12:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:59,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-01 13:12:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:59,531 INFO L225 Difference]: With dead ends: 63 [2020-07-01 13:12:59,531 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 13:12:59,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:12:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 13:12:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-07-01 13:12:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 13:12:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2020-07-01 13:12:59,538 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 17 [2020-07-01 13:12:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:59,538 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-07-01 13:12:59,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2020-07-01 13:12:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 13:12:59,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:59,539 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:59,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 13:12:59,740 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:12:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash 608745030, now seen corresponding path program 1 times [2020-07-01 13:12:59,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:59,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541496862] [2020-07-01 13:12:59,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:59,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541496862] [2020-07-01 13:12:59,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773886290] [2020-07-01 13:12:59,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:59,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:12:59,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:12:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:59,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:12:59,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:12:59,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766802180] [2020-07-01 13:12:59,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:12:59,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:12:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:12:59,843 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand 4 states. [2020-07-01 13:12:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:59,893 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2020-07-01 13:12:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:12:59,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-01 13:12:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:59,894 INFO L225 Difference]: With dead ends: 61 [2020-07-01 13:12:59,894 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 13:12:59,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:12:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 13:12:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-07-01 13:12:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-01 13:12:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2020-07-01 13:12:59,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 20 [2020-07-01 13:12:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:59,901 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2020-07-01 13:12:59,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:12:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2020-07-01 13:12:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 13:12:59,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:59,902 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:00,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:00,103 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash 608745031, now seen corresponding path program 1 times [2020-07-01 13:13:00,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:00,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618766624] [2020-07-01 13:13:00,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:00,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618766624] [2020-07-01 13:13:00,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:00,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:13:00,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839790589] [2020-07-01 13:13:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:13:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:13:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:13:00,170 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand 6 states. [2020-07-01 13:13:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:00,278 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2020-07-01 13:13:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:13:00,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-01 13:13:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:00,279 INFO L225 Difference]: With dead ends: 85 [2020-07-01 13:13:00,279 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 13:13:00,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:13:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 13:13:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-01 13:13:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:13:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-07-01 13:13:00,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2020-07-01 13:13:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:00,284 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-07-01 13:13:00,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:13:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-07-01 13:13:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 13:13:00,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:00,285 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:00,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-01 13:13:00,285 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1923193662, now seen corresponding path program 1 times [2020-07-01 13:13:00,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:00,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96754633] [2020-07-01 13:13:00,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:00,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96754633] [2020-07-01 13:13:00,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236338808] [2020-07-01 13:13:00,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:00,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-01 13:13:00,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:13:00,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:00,467 INFO L377 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-07-01 13:13:00,468 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:00,494 INFO L619 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-07-01 13:13:00,494 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:00,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-07-01 13:13:00,523 INFO L377 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-07-01 13:13:00,523 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:00,532 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:00,533 INFO L539 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-07-01 13:13:00,534 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-07-01 13:13:00,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:00,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 13:13:00,573 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:00,574 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:13:00,583 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:00,584 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:13:00,585 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:00,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:34 [2020-07-01 13:13:00,620 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:00,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:13:00,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-01 13:13:00,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072753810] [2020-07-01 13:13:00,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:13:00,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:00,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:13:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:13:00,666 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 13 states. [2020-07-01 13:13:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:01,179 INFO L93 Difference]: Finished difference Result 75 states and 106 transitions. [2020-07-01 13:13:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:13:01,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-01 13:13:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:01,180 INFO L225 Difference]: With dead ends: 75 [2020-07-01 13:13:01,180 INFO L226 Difference]: Without dead ends: 66 [2020-07-01 13:13:01,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2020-07-01 13:13:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-01 13:13:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2020-07-01 13:13:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 13:13:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2020-07-01 13:13:01,186 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 20 [2020-07-01 13:13:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:01,187 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2020-07-01 13:13:01,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:13:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2020-07-01 13:13:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-01 13:13:01,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:01,188 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:01,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:01,389 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1534943238, now seen corresponding path program 2 times [2020-07-01 13:13:01,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:01,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920809702] [2020-07-01 13:13:01,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:01,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920809702] [2020-07-01 13:13:01,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607524567] [2020-07-01 13:13:01,600 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:01,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:13:01,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:13:01,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 13:13:01,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:13:01,658 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_31|]} [2020-07-01 13:13:01,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:13:01,663 INFO L377 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-07-01 13:13:01,664 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,671 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:13:01,677 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,684 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,684 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,685 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 13:13:01,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:13:01,712 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,723 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,724 INFO L539 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-07-01 13:13:01,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 13:13:01,769 INFO L377 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-07-01 13:13:01,770 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,781 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,782 INFO L539 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-07-01 13:13:01,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 13:13:01,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,862 INFO L377 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-07-01 13:13:01,863 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:01,863 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:13:01,876 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:01,877 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:13:01,878 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:01,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-07-01 13:13:01,908 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:13:01,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:13:01,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 13:13:01,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967921181] [2020-07-01 13:13:01,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:13:01,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:13:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:13:01,925 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 13 states. [2020-07-01 13:13:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:03,100 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2020-07-01 13:13:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 13:13:03,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-01 13:13:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:03,102 INFO L225 Difference]: With dead ends: 114 [2020-07-01 13:13:03,102 INFO L226 Difference]: Without dead ends: 113 [2020-07-01 13:13:03,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2020-07-01 13:13:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-01 13:13:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2020-07-01 13:13:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-01 13:13:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2020-07-01 13:13:03,109 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 27 [2020-07-01 13:13:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:03,110 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2020-07-01 13:13:03,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:13:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2020-07-01 13:13:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-01 13:13:03,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:03,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:03,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 13:13:03,312 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 201837672, now seen corresponding path program 2 times [2020-07-01 13:13:03,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:03,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340287363] [2020-07-01 13:13:03,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:03,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340287363] [2020-07-01 13:13:03,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917942296] [2020-07-01 13:13:03,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:03,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:13:03,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:13:03,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-01 13:13:03,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:13:03,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:03,541 INFO L377 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-07-01 13:13:03,541 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:03,557 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 13:13:03,558 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:03,558 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 13:13:03,573 INFO L377 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-07-01 13:13:03,573 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:03,574 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:03,575 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:03,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 13:13:03,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:03,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:13:03,598 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:03,598 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:13:03,605 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:03,606 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:03,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:13:03,624 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:13:03,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:13:03,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-01 13:13:03,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045267076] [2020-07-01 13:13:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 13:13:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 13:13:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:13:03,647 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand 11 states. [2020-07-01 13:13:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:03,951 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2020-07-01 13:13:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:13:03,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-01 13:13:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:03,952 INFO L225 Difference]: With dead ends: 65 [2020-07-01 13:13:03,952 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 13:13:03,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2020-07-01 13:13:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 13:13:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2020-07-01 13:13:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:13:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2020-07-01 13:13:03,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 30 [2020-07-01 13:13:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:03,958 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2020-07-01 13:13:03,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 13:13:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2020-07-01 13:13:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-01 13:13:03,958 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:03,959 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:04,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:04,160 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1153916855, now seen corresponding path program 1 times [2020-07-01 13:13:04,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:04,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410400117] [2020-07-01 13:13:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 13:13:04,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410400117] [2020-07-01 13:13:04,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:04,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 13:13:04,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509591943] [2020-07-01 13:13:04,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:13:04,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:13:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:13:04,228 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 8 states. [2020-07-01 13:13:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:04,403 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2020-07-01 13:13:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:13:04,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-01 13:13:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:04,405 INFO L225 Difference]: With dead ends: 112 [2020-07-01 13:13:04,405 INFO L226 Difference]: Without dead ends: 79 [2020-07-01 13:13:04,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-07-01 13:13:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-01 13:13:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2020-07-01 13:13:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-01 13:13:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2020-07-01 13:13:04,412 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 37 [2020-07-01 13:13:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:04,412 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2020-07-01 13:13:04,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:13:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2020-07-01 13:13:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-01 13:13:04,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:04,414 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:04,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-01 13:13:04,414 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:13:04,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash 621090507, now seen corresponding path program 1 times [2020-07-01 13:13:04,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:04,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865458621] [2020-07-01 13:13:04,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 13:13:04,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865458621] [2020-07-01 13:13:04,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668104796] [2020-07-01 13:13:04,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:13:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:04,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-01 13:13:04,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:13:04,613 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_32|]} [2020-07-01 13:13:04,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:13:04,622 INFO L377 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-07-01 13:13:04,623 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,631 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:13:04,639 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,646 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,646 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,647 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 13:13:04,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:13:04,668 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,675 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,675 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,675 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 13:13:04,698 INFO L377 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-07-01 13:13:04,699 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,706 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,707 INFO L539 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-07-01 13:13:04,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 13:13:04,770 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,771 INFO L377 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-07-01 13:13:04,772 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:04,772 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:13:04,781 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:13:04,781 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:13:04,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 13:13:04,804 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:13:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 13:13:04,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:13:04,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 13:13:04,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544083876] [2020-07-01 13:13:04,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:13:04,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:13:04,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:13:04,825 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand 13 states. [2020-07-01 13:13:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:05,111 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2020-07-01 13:13:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:13:05,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-07-01 13:13:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:05,112 INFO L225 Difference]: With dead ends: 79 [2020-07-01 13:13:05,113 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:13:05,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-07-01 13:13:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:13:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:13:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:13:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:13:05,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-01 13:13:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:05,114 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:13:05,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:13:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:13:05,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:13:05,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 13:13:05,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:13:05,460 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 181 [2020-07-01 13:13:07,059 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2020-07-01 13:13:07,063 INFO L268 CegarLoopResult]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2020-07-01 13:13:07,063 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,064 INFO L268 CegarLoopResult]: For program point L9-2(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,064 INFO L268 CegarLoopResult]: For program point L9-3(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,064 INFO L268 CegarLoopResult]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,064 INFO L268 CegarLoopResult]: For program point L9-6(lines 9 14) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L264 CegarLoopResult]: At program point L9-8(lines 9 14) the Hoare annotation is: (let ((.cse26 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse24 (select |#memory_int| ULTIMATE.start_subseq_~pt~0.base)) (.cse25 (select |#length| ULTIMATE.start_subseq_~pt~0.base))) (let ((.cse3 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int) (ULTIMATE.start_subseq_~t.base Int)) (and (not (= ULTIMATE.start_subseq_~t.base ULTIMATE.start_subseq_~ps~0.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_subseq_~t.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_subseq_~t.base) (- 1))))))) (.cse11 (= 0 (select .cse24 (+ .cse25 (- 1))))) (.cse12 (<= 1 ULTIMATE.start_subseq_~pt~0.offset)) (.cse15 (<= (+ ULTIMATE.start_subseq_~pt~0.offset 1) .cse25)) (.cse17 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse26 (- 1))))) (.cse0 (select |#length| ULTIMATE.start_subseq_~ps~0.base)) (.cse2 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse18 (select |#memory_int| ULTIMATE.start_subseq_~ps~0.base)) (.cse1 (= .cse26 ULTIMATE.start_main_~length1~0)) (.cse19 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= (select (select |#memory_int| ULTIMATE.start_subseq_~ps~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_subseq_~ps~0.base)) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_subseq_~ps~0.offset ULTIMATE.start_main_~nondetString1~0.offset)))) (.cse4 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base))))) (.cse5 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (<= 1 |#StackHeapBarrier|)) (.cse8 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_subseq_~ps~0.base))) (.cse23 (<= 1 .cse25)) (.cse13 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_subseq_~pt~0.base))) (.cse21 (= 0 ULTIMATE.start_subseq_~pt~0.offset)) (.cse16 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse22 (= ULTIMATE.start_subseq_~ps~0.offset 0))) (or (and (<= (+ ULTIMATE.start_subseq_~ps~0.offset 1) .cse0) .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_subseq_~ps~0.offset) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_subseq_~ps~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_subseq_~ps~0.base) (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset))) .cse16 .cse17) (and .cse3 (= 0 (select .cse18 (+ .cse0 (- 1)))) (let ((.cse20 (<= 1 ULTIMATE.start_main_~length1~0))) (or (and .cse1 .cse2 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse20 .cse15 .cse21 .cse16 .cse22) (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 (<= (+ ULTIMATE.start_subseq_~ps~0.offset 2) .cse0) (<= 0 ULTIMATE.start_subseq_~ps~0.offset)))) .cse17) (and .cse1 (<= 1 .cse0) .cse2 (= 0 (select (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) ULTIMATE.start_main_~nondetString1~0.offset)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse13 .cse14 .cse21 .cse16 .cse22 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (= 0 (select .cse18 ULTIMATE.start_subseq_~ps~0.offset))) (and .cse1 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse9 .cse10 .cse23 .cse13 .cse14 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_subseq_~ps~0.base)))) .cse21 .cse16 .cse22 (= (select .cse24 ULTIMATE.start_subseq_~pt~0.offset) 0))))) [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point L9-9(lines 9 14) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point L22-2(lines 19 33) no Hoare annotation was computed. [2020-07-01 13:13:07,065 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,066 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 12) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point L10-4(lines 10 12) no Hoare annotation was computed. [2020-07-01 13:13:07,067 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:13:07,070 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:13:07,080 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,081 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,082 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:13:07,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,102 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:13:07,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:07 BasicIcfg [2020-07-01 13:13:07,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:13:07,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:13:07,152 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:13:07,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:13:07,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:07,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:12:52" (1/5) ... [2020-07-01 13:13:07,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c844c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:07, skipping insertion in model container [2020-07-01 13:13:07,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:07,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:52" (2/5) ... [2020-07-01 13:13:07,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c844c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:07, skipping insertion in model container [2020-07-01 13:13:07,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:07,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:53" (3/5) ... [2020-07-01 13:13:07,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c844c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:07, skipping insertion in model container [2020-07-01 13:13:07,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:07,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:53" (4/5) ... [2020-07-01 13:13:07,159 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c844c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:07, skipping insertion in model container [2020-07-01 13:13:07,159 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:07,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:07" (5/5) ... [2020-07-01 13:13:07,160 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:13:07,182 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:13:07,182 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:13:07,182 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:13:07,182 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:13:07,182 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:13:07,182 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:13:07,183 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:13:07,183 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:13:07,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-07-01 13:13:07,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:13:07,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:07,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:07,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:13:07,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:07,195 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:13:07,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-07-01 13:13:07,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 13:13:07,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:07,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:07,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:13:07,197 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:07,202 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #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|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #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~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 33#L22true [119] L22-->L22-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[] 11#L22-2true [120] L22-2-->L25-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[] 20#L25-1true [143] L25-1-->L30: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4|)) (< 0 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc10.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4| 1) |v_#valid_6|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, 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~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, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, 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_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, 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, ULTIMATE.start_main_#t~malloc10.offset] 29#L30true [109] L30-->L30-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |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))) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) 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_5|} 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_5|} AuxVars[] AssignedVars[#memory_int] 27#L30-1true [183] L30-1-->L9-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_subseq_~s.base_3) (= v_ULTIMATE.start_subseq_~s.base_3 v_ULTIMATE.start_subseq_~ps~0.base_11) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_subseq_~t.base_3) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~t.offset_3 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~pt~0.offset_11 v_ULTIMATE.start_subseq_~t.offset_3) (= v_ULTIMATE.start_subseq_~s.offset_3 v_ULTIMATE.start_subseq_~ps~0.offset_9) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~s.offset_3 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~pt~0.base_14 v_ULTIMATE.start_subseq_~t.base_3) (= |v_#memory_int_10| (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))))) 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_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_4|, ULTIMATE.start_subseq_#in~s.offset=|v_ULTIMATE.start_subseq_#in~s.offset_2|, ULTIMATE.start_subseq_#t~post5.base=|v_ULTIMATE.start_subseq_#t~post5.base_4|, ULTIMATE.start_subseq_#in~s.base=|v_ULTIMATE.start_subseq_#in~s.base_2|, ULTIMATE.start_subseq_#in~t.base=|v_ULTIMATE.start_subseq_#in~t.base_2|, ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_10|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_9, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_4|, ULTIMATE.start_subseq_~s.offset=v_ULTIMATE.start_subseq_~s.offset_3, ULTIMATE.start_subseq_#in~t.offset=|v_ULTIMATE.start_subseq_#in~t.offset_2|, ULTIMATE.start_subseq_~s.base=v_ULTIMATE.start_subseq_~s.base_3, 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_subseq_~t.base=v_ULTIMATE.start_subseq_~t.base_3, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_14, ULTIMATE.start_subseq_#t~mem7=|v_ULTIMATE.start_subseq_#t~mem7_7|, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_7|, ULTIMATE.start_subseq_#t~post5.offset=|v_ULTIMATE.start_subseq_#t~post5.offset_4|, ULTIMATE.start_subseq_#res=|v_ULTIMATE.start_subseq_#res_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_7|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_6|, #valid=|v_#valid_25|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_6|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_subseq_~t.offset=v_ULTIMATE.start_subseq_~t.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~ps~0.offset, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_#in~s.offset, ULTIMATE.start_subseq_#t~post5.base, ULTIMATE.start_subseq_~s.offset, ULTIMATE.start_subseq_#in~s.base, ULTIMATE.start_subseq_#in~t.base, ULTIMATE.start_subseq_#in~t.offset, ULTIMATE.start_subseq_~s.base, ULTIMATE.start_subseq_~t.base, ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_subseq_#t~mem7, ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~post5.offset, ULTIMATE.start_subseq_#res, ULTIMATE.start_subseq_#t~mem3, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0, #memory_int, ULTIMATE.start_subseq_~ps~0.base, ULTIMATE.start_subseq_~t.offset] 17#L9-8true [2020-07-01 13:13:07,203 INFO L796 eck$LassoCheckResult]: Loop: 17#L9-8true [94] L9-8-->L9-1: Formula: (and (= (select (select |v_#memory_int_5| v_ULTIMATE.start_subseq_~ps~0.base_3) v_ULTIMATE.start_subseq_~ps~0.offset_3) |v_ULTIMATE.start_subseq_#t~mem0_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_subseq_~ps~0.base_3)) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_3) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_subseq_~ps~0.base_3))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #valid=|v_#valid_13|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem0] 9#L9-1true [160] L9-1-->L9-2: Formula: (and (> 0 |v_ULTIMATE.start_subseq_#t~mem0_3|) |v_ULTIMATE.start_subseq_#t~short2_2|) InVars {ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_2|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 7#L9-2true [81] L9-2-->L9-6: Formula: (not |v_ULTIMATE.start_subseq_#t~short2_5|) InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} AuxVars[] AssignedVars[] 21#L9-6true [99] L9-6-->L10: Formula: |v_ULTIMATE.start_subseq_#t~short2_9| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_9|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_8|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_5|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0] 14#L10true [86] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_subseq_~ps~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subseq_~ps~0.base_6) v_ULTIMATE.start_subseq_~ps~0.offset_5) |v_ULTIMATE.start_subseq_#t~mem3_2|) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_subseq_~ps~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem3] 31#L10-1true [112] L10-1-->L10-2: Formula: (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_subseq_~pt~0.base_7)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_subseq_~pt~0.base_7) v_ULTIMATE.start_subseq_~pt~0.offset_6) |v_ULTIMATE.start_subseq_#t~mem4_2|) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_6) (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_subseq_~pt~0.base_7))) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, #memory_int=|v_#memory_int_8|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4] 28#L10-2true [180] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_subseq_#t~mem3_6| |v_ULTIMATE.start_subseq_#t~mem4_6|) InVars {ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_6|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_6|} OutVars{ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~mem3] 25#L10-4true [103] L10-4-->L9-8: Formula: (and (= v_ULTIMATE.start_subseq_~pt~0.offset_8 (+ v_ULTIMATE.start_subseq_~pt~0.offset_9 1)) (= v_ULTIMATE.start_subseq_~pt~0.base_11 v_ULTIMATE.start_subseq_~pt~0.base_10)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_11, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_9} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_2|, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_10, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_2|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_~pt~0.offset] 17#L9-8true [2020-07-01 13:13:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1916656771, now seen corresponding path program 1 times [2020-07-01 13:13:07,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:07,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819020480] [2020-07-01 13:13:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:07,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819020480] [2020-07-01 13:13:07,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:07,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:07,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863061604] [2020-07-01 13:13:07,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:13:07,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1487693122, now seen corresponding path program 1 times [2020-07-01 13:13:07,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:07,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429538126] [2020-07-01 13:13:07,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:07,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429538126] [2020-07-01 13:13:07,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:07,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:13:07,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612773907] [2020-07-01 13:13:07,228 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:13:07,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:07,230 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-07-01 13:13:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:07,279 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-07-01 13:13:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:07,282 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:13:07,285 INFO L168 Benchmark]: Toolchain (without parser) took 14629.88 ms. Allocated memory was 649.6 MB in the beginning and 901.3 MB in the end (delta: 251.7 MB). Free memory was 561.4 MB in the beginning and 662.7 MB in the end (delta: -101.3 MB). Peak memory consumption was 150.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,286 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:13:07,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.38 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 561.4 MB in the beginning and 662.1 MB in the end (delta: -100.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 700.4 MB. Free memory was 662.1 MB in the beginning and 660.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,287 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 ms. Allocated memory is still 700.4 MB. Free memory was 660.0 MB in the beginning and 657.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,287 INFO L168 Benchmark]: RCFGBuilder took 368.96 ms. Allocated memory is still 700.4 MB. Free memory was 657.8 MB in the beginning and 633.5 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,287 INFO L168 Benchmark]: BlockEncodingV2 took 116.47 ms. Allocated memory is still 700.4 MB. Free memory was 633.5 MB in the beginning and 623.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,288 INFO L168 Benchmark]: TraceAbstraction took 13618.10 ms. Allocated memory was 700.4 MB in the beginning and 901.3 MB in the end (delta: 200.8 MB). Free memory was 623.8 MB in the beginning and 688.6 MB in the end (delta: -64.8 MB). Peak memory consumption was 369.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,288 INFO L168 Benchmark]: BuchiAutomizer took 131.61 ms. Allocated memory is still 901.3 MB. Free memory was 688.6 MB in the beginning and 662.7 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:07,290 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 38 locations, 44 edges - StatisticsResult: Encoded RCFG 31 locations, 57 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 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 320.38 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 561.4 MB in the beginning and 662.1 MB in the end (delta: -100.8 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 700.4 MB. Free memory was 662.1 MB in the beginning and 660.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.25 ms. Allocated memory is still 700.4 MB. Free memory was 660.0 MB in the beginning and 657.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 368.96 ms. Allocated memory is still 700.4 MB. Free memory was 657.8 MB in the beginning and 633.5 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 116.47 ms. Allocated memory is still 700.4 MB. Free memory was 633.5 MB in the beginning and 623.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13618.10 ms. Allocated memory was 700.4 MB in the beginning and 901.3 MB in the end (delta: 200.8 MB). Free memory was 623.8 MB in the beginning and 688.6 MB in the end (delta: -64.8 MB). Peak memory consumption was 369.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 131.61 ms. Allocated memory is still 901.3 MB. Free memory was 688.6 MB in the beginning and 662.7 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,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_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,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_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,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_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,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_subseq_~t.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 * 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: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: 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: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: 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: 9]: Loop Invariant [2020-07-01 13:13:07,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:13:07,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,315 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,316 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,317 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,318 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,318 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,318 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,319 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_subseq_~t.base,QUANTIFIED] [2020-07-01 13:13:07,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 13:13:07,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-07-01 13:13:07,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:13:07,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:13:07,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:13:07,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,336 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,345 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,345 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,345 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,345 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:07,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:07,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:13:07,346 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((((((ps + 1 <= unknown-#length-unknown[ps] && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int, ULTIMATE.start_subseq_~t.base : int :: !(ULTIMATE.start_subseq_~t.base == ps) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_subseq_~t.base][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[ULTIMATE.start_subseq_~t.base] + -1])) && 1 <= ps) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1]) && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1])) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 1 == \valid[ps]) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && 1 <= pt) && 0 == nondetString1) && 1 == \valid[pt]) && pt + 1 <= unknown-#length-unknown[pt]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 == unknown-#memory_int-unknown[ps][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[ps] + -1]) && 0 <= ULTIMATE.start_main_~nondetString1~0.offset)) && 1 == \valid[nondetString1]) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) || ((((\exists ULTIMATE.start_main_~nondetString2~0.offset : int, ULTIMATE.start_subseq_~t.base : int :: !(ULTIMATE.start_subseq_~t.base == ps) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_subseq_~t.base][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[ULTIMATE.start_subseq_~t.base] + -1]) && 0 == unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1]) && (((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((unknown-#memory_int-unknown[ps][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0 && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[ps]) && 1 <= ULTIMATE.start_main_~length1~0) && ps <= ULTIMATE.start_main_~nondetString1~0.offset)) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 1 == \valid[ps]) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && 0 == nondetString1) && 1 == \valid[pt]) && 1 <= length1) && pt + 1 <= unknown-#length-unknown[pt]) && 0 == pt) && 1 == \valid[nondetString1]) && ps == 0) || ((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= length2) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[ps]) && 0 == nondetString2) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && 1 <= pt) && 0 == nondetString1) && 1 == \valid[pt]) && pt + 1 <= unknown-#length-unknown[pt]) && 1 <= length1) && 1 == \valid[nondetString1]) && ps + 2 <= unknown-#length-unknown[ps]) && 0 <= ps))) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1])) || (((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= unknown-#length-unknown[ps]) && 1 <= length2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 1 == \valid[ps]) && 1 <= unknown-#length-unknown[pt]) && 0 == nondetString1) && 1 == \valid[pt]) && 0 == pt) && 1 == \valid[nondetString1]) && ps == 0) && 1 == nondetString1 + length1) && 0 == unknown-#memory_int-unknown[ps][ps])) || (((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int, ULTIMATE.start_main_~length1~0 : int :: ((unknown-#memory_int-unknown[ps][ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 + -1] == 0 && ULTIMATE.start_main_~nondetString1~0.offset + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[ps]) && 1 <= ULTIMATE.start_main_~length1~0) && ps <= ULTIMATE.start_main_~nondetString1~0.offset)) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1]) && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1])) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 == length2 + nondetString2) && 0 == nondetString2) && 1 == \valid[ps]) && 1 <= unknown-#length-unknown[pt]) && 0 == nondetString1) && 1 == \valid[pt]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == ps))) && 0 == pt) && 1 == \valid[nondetString1]) && ps == 0) && unknown-#memory_int-unknown[pt][pt] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.7s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 2616 SDslu, 899 SDs, 0 SdLazy, 1928 SolverSat, 183 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 189 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 13 NumberOfFragments, 595 HoareAnnotationTreeSize, 1 FomulaSimplifications, 7245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 6259 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 507 ConstructedInterpolants, 39 QuantifiedInterpolants, 113175 SizeOfPredicates, 69 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 72/187 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:12:49.400 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_XSKbyf/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:13:07.574 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check