/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:05:20,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:05:20,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:05:20,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:05:20,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:05:20,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:05:20,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:05:20,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:05:20,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:05:20,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:05:20,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:05:20,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:05:20,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:05:20,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:05:20,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:05:20,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:05:20,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:05:20,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:05:20,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:05:20,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:05:20,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:05:20,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:05:20,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:05:20,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:05:20,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:05:20,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:05:20,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:05:20,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:05:20,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:05:20,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:05:20,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:05:20,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:05:20,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:05:20,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:05:20,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:05:20,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:05:20,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:05:20,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:05:20,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:05:20,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:05:20,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:05:20,564 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:05:20,578 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:05:20,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:05:20,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:05:20,579 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:05:20,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:05:20,580 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:20,580 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:05:20,580 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:05:20,580 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:05:20,581 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:05:20,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:05:20,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:05:20,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:05:20,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:05:20,582 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:05:20,583 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:05:20,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:05:20,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:05:20,583 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:05:20,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:05:20,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:05:20,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:05:20,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:05:20,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:05:20,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:05:20,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:05:20,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:05:20,766 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:05:20,767 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:05:20,768 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:05:20,831 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_EaFuSy/tmp/fdc6061d664544a5b713e6465ff686ef/FLAG166f2704c [2020-07-01 13:05:21,160 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:05:21,161 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:05:21,161 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:05:21,167 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_EaFuSy/tmp/fdc6061d664544a5b713e6465ff686ef/FLAG166f2704c [2020-07-01 13:05:21,567 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_EaFuSy/tmp/fdc6061d664544a5b713e6465ff686ef [2020-07-01 13:05:21,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:05:21,579 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:05:21,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:21,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:05:21,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:05:21,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e88a628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21, skipping insertion in model container [2020-07-01 13:05:21,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:05:21,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:05:21,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:21,858 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:05:21,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:21,891 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:05:21,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21 WrapperNode [2020-07-01 13:05:21,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:21,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:21,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:05:21,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:05:21,902 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:05:21" (1/1) ... [2020-07-01 13:05:21,911 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:05:21" (1/1) ... [2020-07-01 13:05:21,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:21,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:05:21,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:05:21,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:05:21,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:05:21,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:05:21,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:05:21,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:05:21,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (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:05:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:05:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:05:22,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:05:22,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:05:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:05:22,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:05:22,322 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:05:22,323 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:05:22,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22 BoogieIcfgContainer [2020-07-01 13:05:22,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:05:22,327 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:05:22,327 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:05:22,329 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:05:22,330 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,345 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 56 edges [2020-07-01 13:05:22,347 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:05:22,348 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:05:22,348 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:05:22,349 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:22,351 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:05:22,352 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:05:22,352 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:05:22,380 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:05:22,416 INFO L200 BlockEncoder]: SBE split 28 edges [2020-07-01 13:05:22,421 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:05:22,422 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:22,459 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:05:22,462 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:05:22,464 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:05:22,464 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:22,464 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:05:22,465 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:05:22,465 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 80 edges [2020-07-01 13:05:22,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22 BasicIcfg [2020-07-01 13:05:22,466 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:05:22,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:05:22,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:05:22,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:05:22,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:05:21" (1/4) ... [2020-07-01 13:05:22,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f69804e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (2/4) ... [2020-07-01 13:05:22,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f69804e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (3/4) ... [2020-07-01 13:05:22,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f69804e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22" (4/4) ... [2020-07-01 13:05:22,475 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:22,486 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:05:22,493 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2020-07-01 13:05:22,507 INFO L251 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2020-07-01 13:05:22,530 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:05:22,531 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:05:22,531 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:22,531 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:22,531 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:22,531 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:05:22,531 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:22,531 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:05:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-01 13:05:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:22,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:22,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:22,554 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 119551, now seen corresponding path program 1 times [2020-07-01 13:05:22,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:22,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160421107] [2020-07-01 13:05:22,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:22,726 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:05:22,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160421107] [2020-07-01 13:05:22,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:22,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:22,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532998218] [2020-07-01 13:05:22,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:22,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:22,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:22,767 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 13:05:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:22,918 INFO L93 Difference]: Finished difference Result 84 states and 151 transitions. [2020-07-01 13:05:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:22,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:22,933 INFO L225 Difference]: With dead ends: 84 [2020-07-01 13:05:22,933 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:05:22,936 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:05:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:05:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 13:05:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:05:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2020-07-01 13:05:22,977 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 3 [2020-07-01 13:05:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:22,977 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2020-07-01 13:05:22,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2020-07-01 13:05:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:22,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:22,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:22,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:05:22,980 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash 119644, now seen corresponding path program 1 times [2020-07-01 13:05:22,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:22,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319710855] [2020-07-01 13:05:22,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,041 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:05:23,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319710855] [2020-07-01 13:05:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43250651] [2020-07-01 13:05:23,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,045 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand 3 states. [2020-07-01 13:05:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,164 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2020-07-01 13:05:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,166 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:05:23,166 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:05:23,167 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:05:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:05:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:05:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:05:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2020-07-01 13:05:23,173 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 3 [2020-07-01 13:05:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,173 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 65 transitions. [2020-07-01 13:05:23,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2020-07-01 13:05:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:23,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:23,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:05:23,174 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash 119646, now seen corresponding path program 1 times [2020-07-01 13:05:23,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827384553] [2020-07-01 13:05:23,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,208 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:05:23,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827384553] [2020-07-01 13:05:23,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059328125] [2020-07-01 13:05:23,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,210 INFO L87 Difference]: Start difference. First operand 39 states and 65 transitions. Second operand 3 states. [2020-07-01 13:05:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,291 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2020-07-01 13:05:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,292 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:05:23,292 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:05:23,293 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:05:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:05:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:05:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:05:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2020-07-01 13:05:23,298 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 3 [2020-07-01 13:05:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,298 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2020-07-01 13:05:23,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2020-07-01 13:05:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:23,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:23,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:05:23,299 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,300 INFO L82 PathProgramCache]: Analyzing trace with hash 119647, now seen corresponding path program 1 times [2020-07-01 13:05:23,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755929729] [2020-07-01 13:05:23,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,340 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:05:23,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755929729] [2020-07-01 13:05:23,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745374958] [2020-07-01 13:05:23,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,342 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand 3 states. [2020-07-01 13:05:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,438 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2020-07-01 13:05:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,441 INFO L225 Difference]: With dead ends: 39 [2020-07-01 13:05:23,441 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 13:05:23,441 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:05:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 13:05:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 13:05:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 13:05:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2020-07-01 13:05:23,446 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 3 [2020-07-01 13:05:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,446 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2020-07-01 13:05:23,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2020-07-01 13:05:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:05:23,447 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:05:23,447 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash -733163003, now seen corresponding path program 1 times [2020-07-01 13:05:23,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17191675] [2020-07-01 13:05:23,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,473 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:05:23,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17191675] [2020-07-01 13:05:23,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:23,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417272005] [2020-07-01 13:05:23,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,476 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 3 states. [2020-07-01 13:05:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,587 INFO L93 Difference]: Finished difference Result 76 states and 126 transitions. [2020-07-01 13:05:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:05:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,588 INFO L225 Difference]: With dead ends: 76 [2020-07-01 13:05:23,588 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:05:23,589 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:05:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:05:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-01 13:05:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:05:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2020-07-01 13:05:23,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 6 [2020-07-01 13:05:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,595 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-07-01 13:05:23,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2020-07-01 13:05:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:05:23,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:05:23,596 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -733162042, now seen corresponding path program 1 times [2020-07-01 13:05:23,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520222652] [2020-07-01 13:05:23,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,630 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:05:23,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520222652] [2020-07-01 13:05:23,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284526893] [2020-07-01 13:05:23,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,632 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 3 states. [2020-07-01 13:05:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,714 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2020-07-01 13:05:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:05:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,716 INFO L225 Difference]: With dead ends: 37 [2020-07-01 13:05:23,716 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:05:23,717 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:05:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:05:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:05:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:05:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2020-07-01 13:05:23,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 6 [2020-07-01 13:05:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,721 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 53 transitions. [2020-07-01 13:05:23,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2020-07-01 13:05:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:05:23,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:05:23,722 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash -733162040, now seen corresponding path program 1 times [2020-07-01 13:05:23,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763881599] [2020-07-01 13:05:23,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,760 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:05:23,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763881599] [2020-07-01 13:05:23,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752999488] [2020-07-01 13:05:23,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,762 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand 3 states. [2020-07-01 13:05:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,832 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-01 13:05:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:05:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,834 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:05:23,834 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:05:23,834 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:05:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:05:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:05:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:05:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-07-01 13:05:23,838 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 6 [2020-07-01 13:05:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,838 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-07-01 13:05:23,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-07-01 13:05:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 13:05:23,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:05:23,840 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,840 INFO L82 PathProgramCache]: Analyzing trace with hash -194971428, now seen corresponding path program 1 times [2020-07-01 13:05:23,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144965559] [2020-07-01 13:05:23,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,863 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:05:23,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144965559] [2020-07-01 13:05:23,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:23,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545295979] [2020-07-01 13:05:23,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,866 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 3 states. [2020-07-01 13:05:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,920 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-07-01 13:05:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-01 13:05:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,921 INFO L225 Difference]: With dead ends: 62 [2020-07-01 13:05:23,921 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:05:23,922 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:05:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:05:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 13:05:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 13:05:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-07-01 13:05:23,925 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 8 [2020-07-01 13:05:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,925 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-07-01 13:05:23,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-07-01 13:05:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:05:23,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:05:23,926 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1882688451, now seen corresponding path program 1 times [2020-07-01 13:05:23,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113738934] [2020-07-01 13:05:23,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,958 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:05:23,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113738934] [2020-07-01 13:05:23,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413663459] [2020-07-01 13:05:23,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,960 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 3 states. [2020-07-01 13:05:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,005 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2020-07-01 13:05:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:05:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:24,006 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:05:24,006 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:05:24,007 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:05:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:05:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 13:05:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 13:05:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-01 13:05:24,010 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 10 [2020-07-01 13:05:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:24,010 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-01 13:05:24,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-01 13:05:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:05:24,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:24,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:05:24,012 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1882688449, now seen corresponding path program 1 times [2020-07-01 13:05:24,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341395751] [2020-07-01 13:05:24,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,039 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:05:24,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341395751] [2020-07-01 13:05:24,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:24,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676394136] [2020-07-01 13:05:24,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:24,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,041 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 3 states. [2020-07-01 13:05:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,069 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-01 13:05:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:05:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:24,070 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:05:24,070 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:05:24,071 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:05:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:05:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 13:05:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 13:05:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-01 13:05:24,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2020-07-01 13:05:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:24,074 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-01 13:05:24,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-01 13:05:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:05:24,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:24,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:05:24,075 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1882688448, now seen corresponding path program 1 times [2020-07-01 13:05:24,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840213490] [2020-07-01 13:05:24,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,116 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:05:24,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840213490] [2020-07-01 13:05:24,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:24,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373481370] [2020-07-01 13:05:24,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:24,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,118 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2020-07-01 13:05:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,154 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-01 13:05:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:05:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:24,155 INFO L225 Difference]: With dead ends: 25 [2020-07-01 13:05:24,155 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:05:24,156 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:05:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:05:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:05:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:05:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:05:24,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-01 13:05:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:24,157 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:05:24,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:05:24,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:05:24,157 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:05:24,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:05:24,199 INFO L268 CegarLoopResult]: For program point L10-9(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,199 INFO L268 CegarLoopResult]: For program point L10-11(lines 10 19) no Hoare annotation was computed. [2020-07-01 13:05:24,199 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,200 INFO L268 CegarLoopResult]: For program point L11(lines 11 18) no Hoare annotation was computed. [2020-07-01 13:05:24,200 INFO L264 CegarLoopResult]: At program point L11-2(lines 10 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~d~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_main_~d~0.base)) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (= 0 ULTIMATE.start_main_~d~0.offset) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:05:24,200 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:05:24,200 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:05:24,200 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,201 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,202 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:05:24,203 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point L10-6(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,204 INFO L268 CegarLoopResult]: For program point L10-7(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,205 INFO L268 CegarLoopResult]: For program point L10-8(line 10) no Hoare annotation was computed. [2020-07-01 13:05:24,207 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:05:24,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:24 BasicIcfg [2020-07-01 13:05:24,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:05:24,229 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:05:24,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:05:24,233 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:05:24,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:05:21" (1/5) ... [2020-07-01 13:05:24,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cad184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21" (2/5) ... [2020-07-01 13:05:24,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cad184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (3/5) ... [2020-07-01 13:05:24,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cad184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22" (4/5) ... [2020-07-01 13:05:24,236 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cad184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,236 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:24" (5/5) ... [2020-07-01 13:05:24,238 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:24,259 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:05:24,259 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:05:24,259 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:24,260 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:24,260 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:24,260 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:05:24,260 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:24,260 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:05:24,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 13:05:24,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-07-01 13:05:24,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:24,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:24,276 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:05:24,276 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,276 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:05:24,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 13:05:24,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-07-01 13:05:24,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:24,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:24,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:05:24,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,284 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [88] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [169] L-1-->L11-2: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 10#L11-2true [2020-07-01 13:05:24,285 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-2true [80] L11-2-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 31#L10-1true [174] L10-1-->L10-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem3_3|) (not |v_ULTIMATE.start_main_#t~short5_2|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_2|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5] 29#L10-2true [120] L10-2-->L10-6: Formula: (not |v_ULTIMATE.start_main_#t~short5_5|) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_5|} AuxVars[] AssignedVars[] 44#L10-6true [180] L10-6-->L10-7: Formula: (and (not |v_ULTIMATE.start_main_#t~short5_6|) (not |v_ULTIMATE.start_main_#t~short7_2|)) InVars {ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 42#L10-7true [133] L10-7-->L10-11: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 33#L10-11true [123] L10-11-->L11: Formula: |v_ULTIMATE.start_main_#t~short7_9| InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_9|} OutVars{ULTIMATE.start_main_#t~short5=|v_ULTIMATE.start_main_#t~short5_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short5, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 36#L11true [190] L11-->L12: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet8_3|) InVars {ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_3|} OutVars{ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8] 17#L12true [104] L12-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, #valid=|v_#valid_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 15#L12-1true [228] L12-1-->L13: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_13) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem9_6| (- 1)))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_17)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~x~0.base_17))) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 41#L13true [230] L13-->L11-2: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~d~0.base_16)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_main_~d~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_main_~d~0.base_16) v_ULTIMATE.start_main_~d~0.offset_12 |v_ULTIMATE.start_main_#t~nondet10_5|)) |v_#memory_int_23|) (<= 0 v_ULTIMATE.start_main_~d~0.offset_12)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_12, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_16, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, #memory_int] 10#L11-2true [2020-07-01 13:05:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash 3858, now seen corresponding path program 1 times [2020-07-01 13:05:24,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814368225] [2020-07-01 13:05:24,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,307 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:05:24,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814368225] [2020-07-01 13:05:24,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:05:24,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769404087] [2020-07-01 13:05:24,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:05:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2145126493, now seen corresponding path program 1 times [2020-07-01 13:05:24,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943216658] [2020-07-01 13:05:24,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,322 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:05:24,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943216658] [2020-07-01 13:05:24,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:24,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409956902] [2020-07-01 13:05:24,323 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:05:24,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,325 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 13:05:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,393 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2020-07-01 13:05:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,396 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:05:24,400 INFO L168 Benchmark]: Toolchain (without parser) took 2820.34 ms. Allocated memory was 514.9 MB in the beginning and 591.9 MB in the end (delta: 77.1 MB). Free memory was 437.9 MB in the beginning and 408.3 MB in the end (delta: 29.6 MB). Peak memory consumption was 106.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,401 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:05:24,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.40 ms. Allocated memory was 514.9 MB in the beginning and 567.8 MB in the end (delta: 53.0 MB). Free memory was 437.9 MB in the beginning and 534.5 MB in the end (delta: -96.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 567.8 MB. Free memory was 534.5 MB in the beginning and 532.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,403 INFO L168 Benchmark]: Boogie Preprocessor took 24.87 ms. Allocated memory is still 567.8 MB. Free memory was 532.5 MB in the beginning and 531.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,403 INFO L168 Benchmark]: RCFGBuilder took 368.80 ms. Allocated memory is still 567.8 MB. Free memory was 531.1 MB in the beginning and 507.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,404 INFO L168 Benchmark]: BlockEncodingV2 took 138.97 ms. Allocated memory is still 567.8 MB. Free memory was 507.0 MB in the beginning and 496.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,404 INFO L168 Benchmark]: TraceAbstraction took 1761.44 ms. Allocated memory was 567.8 MB in the beginning and 591.9 MB in the end (delta: 24.1 MB). Free memory was 495.5 MB in the beginning and 434.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 85.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,405 INFO L168 Benchmark]: BuchiAutomizer took 168.63 ms. Allocated memory is still 591.9 MB. Free memory was 434.5 MB in the beginning and 408.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 56 edges - StatisticsResult: Encoded RCFG 43 locations, 80 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.40 ms. Allocated memory was 514.9 MB in the beginning and 567.8 MB in the end (delta: 53.0 MB). Free memory was 437.9 MB in the beginning and 534.5 MB in the end (delta: -96.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 567.8 MB. Free memory was 534.5 MB in the beginning and 532.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.87 ms. Allocated memory is still 567.8 MB. Free memory was 532.5 MB in the beginning and 531.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 368.80 ms. Allocated memory is still 567.8 MB. Free memory was 531.1 MB in the beginning and 507.0 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 138.97 ms. Allocated memory is still 567.8 MB. Free memory was 507.0 MB in the beginning and 496.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1761.44 ms. Allocated memory was 567.8 MB in the beginning and 591.9 MB in the end (delta: 24.1 MB). Free memory was 495.5 MB in the beginning and 434.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 85.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 168.63 ms. Allocated memory is still 591.9 MB. Free memory was 434.5 MB in the beginning and 408.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 * 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: 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: 15]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 13:05:24,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[d] && 4 == unknown-#length-unknown[y]) && \valid[x] == 1) && 1 == \valid[d]) && 0 == y) && unknown-#length-unknown[x] == 4) && 0 == d) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 22 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 116 SDtfs, 401 SDslu, 89 SDs, 0 SdLazy, 487 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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:05:18.323 ----------------------------------------------- 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_EaFuSy/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:05:24.645 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check