/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 12:36:21,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:36:21,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:36:21,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:36:21,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:36:21,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:36:21,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:36:21,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:36:21,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:36:21,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:36:21,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:36:21,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:36:21,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:36:21,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:36:21,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:36:21,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:36:21,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:36:21,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:36:21,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:36:21,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:36:21,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:36:21,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:36:21,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:36:21,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:36:21,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:36:21,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:36:21,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:36:21,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:36:21,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:36:21,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:36:21,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:36:21,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:36:21,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:36:21,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:36:21,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:36:21,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:36:21,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:36:21,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:36:21,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:36:21,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:36:21,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:36:21,637 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:36:21,651 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:36:21,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:36:21,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:36:21,652 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:36:21,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:36:21,652 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:21,653 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:36:21,653 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:36:21,653 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:36:21,653 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:36:21,653 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:36:21,653 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:36:21,654 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:36:21,654 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:36:21,654 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:36:21,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:36:21,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:36:21,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:36:21,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:36:21,655 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:36:21,655 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:36:21,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:36:21,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:36:21,656 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:36:21,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:36:21,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:36:21,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:36:21,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:36:21,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:36:21,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:36:21,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:36:21,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:36:21,841 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:36:21,841 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:36:21,842 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:36:21,911 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_nQv_4L/tmp/7a1ec396b45e4c3db059b257562521de/FLAG90e05614f [2020-07-01 12:36:22,250 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:36:22,250 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:36:22,251 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:36:22,257 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_nQv_4L/tmp/7a1ec396b45e4c3db059b257562521de/FLAG90e05614f [2020-07-01 12:36:22,652 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_nQv_4L/tmp/7a1ec396b45e4c3db059b257562521de [2020-07-01 12:36:22,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:36:22,665 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:36:22,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:22,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:36:22,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:36:22,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:22,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de52c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22, skipping insertion in model container [2020-07-01 12:36:22,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:22,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:36:22,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:36:22,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:22,939 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:36:22,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:22,973 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:36:22,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22 WrapperNode [2020-07-01 12:36:22,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:22,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:22,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:36:22,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:36:22,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:22,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:23,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:36:23,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:36:23,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:36:23,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (1/1) ... [2020-07-01 12:36:23,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:36:23,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:36:23,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:36:23,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:36:23,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (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 12:36:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:36:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:36:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:36:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:36:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:36:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:36:23,521 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:36:23,522 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:36:23,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23 BoogieIcfgContainer [2020-07-01 12:36:23,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:36:23,527 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:36:23,527 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:36:23,529 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:36:23,530 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,547 INFO L313 BlockEncoder]: Initial Icfg 79 locations, 86 edges [2020-07-01 12:36:23,548 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:36:23,549 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:36:23,550 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:36:23,550 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:23,552 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:36:23,553 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:36:23,553 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:36:23,583 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:36:23,623 INFO L200 BlockEncoder]: SBE split 44 edges [2020-07-01 12:36:23,629 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:36:23,631 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:23,657 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:36:23,660 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 12:36:23,662 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:36:23,662 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:23,671 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 12:36:23,671 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:36:23,672 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:36:23,672 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:23,673 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:36:23,673 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:36:23,674 INFO L313 BlockEncoder]: Encoded RCFG 67 locations, 121 edges [2020-07-01 12:36:23,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:23 BasicIcfg [2020-07-01 12:36:23,674 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:36:23,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:36:23,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:36:23,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:36:23,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:36:22" (1/4) ... [2020-07-01 12:36:23,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157a4ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:23, skipping insertion in model container [2020-07-01 12:36:23,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (2/4) ... [2020-07-01 12:36:23,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157a4ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:23, skipping insertion in model container [2020-07-01 12:36:23,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (3/4) ... [2020-07-01 12:36:23,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157a4ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:23, skipping insertion in model container [2020-07-01 12:36:23,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:23" (4/4) ... [2020-07-01 12:36:23,683 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:23,694 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:36:23,701 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2020-07-01 12:36:23,716 INFO L251 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2020-07-01 12:36:23,740 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:36:23,740 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:36:23,740 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:23,741 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:23,741 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:23,741 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:36:23,741 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:23,741 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:36:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2020-07-01 12:36:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:23,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:23,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:23,765 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash 182135, now seen corresponding path program 1 times [2020-07-01 12:36:23,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:23,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836847064] [2020-07-01 12:36:23,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:23,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836847064] [2020-07-01 12:36:23,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:23,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:23,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858625574] [2020-07-01 12:36:23,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:23,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:23,959 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2020-07-01 12:36:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,144 INFO L93 Difference]: Finished difference Result 132 states and 233 transitions. [2020-07-01 12:36:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,158 INFO L225 Difference]: With dead ends: 132 [2020-07-01 12:36:24,158 INFO L226 Difference]: Without dead ends: 67 [2020-07-01 12:36:24,162 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 12:36:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-01 12:36:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-01 12:36:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-01 12:36:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 114 transitions. [2020-07-01 12:36:24,203 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 114 transitions. Word has length 3 [2020-07-01 12:36:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,203 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 114 transitions. [2020-07-01 12:36:24,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2020-07-01 12:36:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:36:24,206 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 181980, now seen corresponding path program 1 times [2020-07-01 12:36:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419024909] [2020-07-01 12:36:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,266 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 12:36:24,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419024909] [2020-07-01 12:36:24,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61607461] [2020-07-01 12:36:24,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,271 INFO L87 Difference]: Start difference. First operand 67 states and 114 transitions. Second operand 3 states. [2020-07-01 12:36:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,463 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2020-07-01 12:36:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,465 INFO L225 Difference]: With dead ends: 67 [2020-07-01 12:36:24,466 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 12:36:24,467 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 12:36:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 12:36:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-01 12:36:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-01 12:36:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 96 transitions. [2020-07-01 12:36:24,474 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 96 transitions. Word has length 3 [2020-07-01 12:36:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,474 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 96 transitions. [2020-07-01 12:36:24,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 96 transitions. [2020-07-01 12:36:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:36:24,475 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 181982, now seen corresponding path program 1 times [2020-07-01 12:36:24,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837348187] [2020-07-01 12:36:24,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:24,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837348187] [2020-07-01 12:36:24,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292164926] [2020-07-01 12:36:24,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,506 INFO L87 Difference]: Start difference. First operand 58 states and 96 transitions. Second operand 3 states. [2020-07-01 12:36:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,640 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2020-07-01 12:36:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,642 INFO L225 Difference]: With dead ends: 67 [2020-07-01 12:36:24,643 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 12:36:24,643 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 12:36:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 12:36:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-01 12:36:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-01 12:36:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2020-07-01 12:36:24,649 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 3 [2020-07-01 12:36:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,649 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2020-07-01 12:36:24,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2020-07-01 12:36:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:36:24,651 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 181983, now seen corresponding path program 1 times [2020-07-01 12:36:24,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397530534] [2020-07-01 12:36:24,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,696 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 12:36:24,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397530534] [2020-07-01 12:36:24,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929696774] [2020-07-01 12:36:24,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,699 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand 3 states. [2020-07-01 12:36:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,819 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2020-07-01 12:36:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,821 INFO L225 Difference]: With dead ends: 58 [2020-07-01 12:36:24,821 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 12:36:24,821 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 12:36:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 12:36:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 12:36:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:36:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2020-07-01 12:36:24,827 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 3 [2020-07-01 12:36:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,827 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2020-07-01 12:36:24,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2020-07-01 12:36:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:36:24,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:36:24,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:36:24,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,829 INFO L82 PathProgramCache]: Analyzing trace with hash 5644308, now seen corresponding path program 1 times [2020-07-01 12:36:24,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515197445] [2020-07-01 12:36:24,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,861 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 12:36:24,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515197445] [2020-07-01 12:36:24,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684364772] [2020-07-01 12:36:24,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,864 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand 3 states. [2020-07-01 12:36:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,957 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2020-07-01 12:36:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:36:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,958 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:36:24,959 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:36:24,959 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 12:36:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:36:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:36:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:36:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-07-01 12:36:24,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 4 [2020-07-01 12:36:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,964 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-07-01 12:36:24,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-07-01 12:36:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:36:24,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:36:24,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:36:24,965 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 5644310, now seen corresponding path program 1 times [2020-07-01 12:36:24,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648916615] [2020-07-01 12:36:24,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648916615] [2020-07-01 12:36:25,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541701535] [2020-07-01 12:36:25,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,007 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 3 states. [2020-07-01 12:36:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,089 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-07-01 12:36:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:36:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,091 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:36:25,091 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:36:25,091 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 12:36:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:36:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:36:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:36:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-07-01 12:36:25,095 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 4 [2020-07-01 12:36:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,095 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-07-01 12:36:25,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-07-01 12:36:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:36:25,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:36:25,096 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash 174976387, now seen corresponding path program 1 times [2020-07-01 12:36:25,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020743705] [2020-07-01 12:36:25,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,124 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 12:36:25,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020743705] [2020-07-01 12:36:25,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311108191] [2020-07-01 12:36:25,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,126 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 3 states. [2020-07-01 12:36:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,184 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-01 12:36:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:36:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,185 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:36:25,185 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:36:25,186 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 12:36:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:36:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:36:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:36:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-07-01 12:36:25,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 5 [2020-07-01 12:36:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,190 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-07-01 12:36:25,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-07-01 12:36:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:36:25,191 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:36:25,191 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 174976389, now seen corresponding path program 1 times [2020-07-01 12:36:25,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252726789] [2020-07-01 12:36:25,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,221 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 12:36:25,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252726789] [2020-07-01 12:36:25,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402620185] [2020-07-01 12:36:25,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,223 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2020-07-01 12:36:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,271 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2020-07-01 12:36:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:36:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,272 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:36:25,272 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:36:25,272 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 12:36:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:36:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:36:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:36:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:36:25,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:36:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,274 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:36:25,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:36:25,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:36:25,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:36:25,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:36:25,310 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,310 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,310 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,310 INFO L268 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,310 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:36:25,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L24-2(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L24-4(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L24-5(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,313 INFO L268 CegarLoopResult]: For program point L24-6(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point L24-7(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point L24-9(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point L24-10(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point L24-11(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:36:25,314 INFO L268 CegarLoopResult]: For program point L24-12(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point L24-14(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point L24-15(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point L24-16(lines 24 26) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,315 INFO L268 CegarLoopResult]: For program point L33-1(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,316 INFO L268 CegarLoopResult]: For program point L29(lines 29 34) no Hoare annotation was computed. [2020-07-01 12:36:25,316 INFO L264 CegarLoopResult]: At program point L29-2(lines 28 35) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_main_~N~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~N~0.base)) (= 0 ULTIMATE.start_main_~N~0.offset) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,317 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point L30-2(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 27) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,318 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 12:36:25,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:36:25,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:36:25,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:25,322 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:36:25,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:25,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,349 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:25,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:25 BasicIcfg [2020-07-01 12:36:25,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:36:25,352 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:36:25,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:36:25,356 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:36:25,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:25,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:36:22" (1/5) ... [2020-07-01 12:36:25,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f35cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:25, skipping insertion in model container [2020-07-01 12:36:25,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:25,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:22" (2/5) ... [2020-07-01 12:36:25,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f35cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:25, skipping insertion in model container [2020-07-01 12:36:25,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:25,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (3/5) ... [2020-07-01 12:36:25,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f35cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:25, skipping insertion in model container [2020-07-01 12:36:25,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:25,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:23" (4/5) ... [2020-07-01 12:36:25,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f35cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:25, skipping insertion in model container [2020-07-01 12:36:25,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:25,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:25" (5/5) ... [2020-07-01 12:36:25,361 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:25,384 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:36:25,385 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:36:25,385 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:25,385 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:25,385 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:25,385 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:36:25,385 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:25,385 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:36:25,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states. [2020-07-01 12:36:25,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:36:25,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:25,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:25,402 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:25,402 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,402 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:36:25,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states. [2020-07-01 12:36:25,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:36:25,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:25,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:25,406 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:25,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,412 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [150] 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] 9#L-1true [255] L-1-->L19: 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|) (= 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~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~N~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|) (< |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|) (= |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~mem21=|v_ULTIMATE.start_main_#t~mem21_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~mem20=|v_ULTIMATE.start_main_#t~mem20_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~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_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_1|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_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_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem21, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~mem20, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_~y~0.base, #length, ULTIMATE.start_main_#t~short12, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short8, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~mem6] 24#L19true [344] L19-->L20: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_41| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_26| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_26| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_22)) InVars {ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31} OutVars{ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_41|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 45#L20true [345] L20-->L21: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_16) (<= (+ v_ULTIMATE.start_main_~y~0.offset_16 4) (select |v_#length_42| v_ULTIMATE.start_main_~y~0.base_22)) (= (store |v_#memory_int_28| v_ULTIMATE.start_main_~y~0.base_22 (store (select |v_#memory_int_28| v_ULTIMATE.start_main_~y~0.base_22) v_ULTIMATE.start_main_~y~0.offset_16 |v_ULTIMATE.start_main_#t~nondet4_5|)) |v_#memory_int_27|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_main_~y~0.base_22))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_42|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_22, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_16, #length=|v_#length_42|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] 11#L21true [346] L21-->L24: Formula: (and (= (select |v_#valid_53| v_ULTIMATE.start_main_~N~0.base_13) 1) (= (store |v_#memory_int_30| v_ULTIMATE.start_main_~N~0.base_13 (store (select |v_#memory_int_30| v_ULTIMATE.start_main_~N~0.base_13) v_ULTIMATE.start_main_~N~0.offset_10 |v_ULTIMATE.start_main_#t~nondet5_5|)) |v_#memory_int_29|) (<= 0 v_ULTIMATE.start_main_~N~0.offset_10) (<= (+ v_ULTIMATE.start_main_~N~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~N~0.base_13))) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_10, #length=|v_#length_43|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_13} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_10, #length=|v_#length_43|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int] 68#L24true [203] L24-->L24-1: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~N~0.base_7)) (<= 0 v_ULTIMATE.start_main_~N~0.offset_6) (<= (+ v_ULTIMATE.start_main_~N~0.offset_6 4) (select |v_#length_11| v_ULTIMATE.start_main_~N~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_main_~N~0.base_7) v_ULTIMATE.start_main_~N~0.offset_6))) InVars {ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_7, #valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_6, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 67#L24-1true [275] L24-1-->L24-2: Formula: (and (<= 536870912 |v_ULTIMATE.start_main_#t~mem6_3|) |v_ULTIMATE.start_main_#t~short8_2|) InVars {ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|} OutVars{ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_3|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short8] 66#L24-2true [200] L24-2-->L24-6: Formula: |v_ULTIMATE.start_main_#t~short8_3| InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} OutVars{ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_3|} AuxVars[] AssignedVars[] 42#L24-6true [277] L24-6-->L24-7: Formula: (and |v_ULTIMATE.start_main_#t~short10_2| |v_ULTIMATE.start_main_#t~short8_6|) InVars {ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_2|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short10] 39#L24-7true [166] L24-7-->L24-11: Formula: |v_ULTIMATE.start_main_#t~short10_3| InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_3|} AuxVars[] AssignedVars[] 54#L24-11true [285] L24-11-->L24-12: Formula: (and |v_ULTIMATE.start_main_#t~short12_2| |v_ULTIMATE.start_main_#t~short10_6|) InVars {ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_6|} OutVars{ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_6|, ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short12] 52#L24-12true [184] L24-12-->L24-16: Formula: |v_ULTIMATE.start_main_#t~short12_3| InVars {ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_3|} OutVars{ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_3|} AuxVars[] AssignedVars[] 22#L24-16true [141] L24-16-->L27: Formula: (not |v_ULTIMATE.start_main_#t~short12_9|) InVars {ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_9|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_#t~short12=|v_ULTIMATE.start_main_#t~short12_8|, ULTIMATE.start_main_#t~short10=|v_ULTIMATE.start_main_#t~short10_8|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~short8=|v_ULTIMATE.start_main_#t~short8_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~short12, ULTIMATE.start_main_#t~short10, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~short8] 36#L27true [163] L27-->L27-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_13)) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~x~0.base_13))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 35#L27-1true [351] L27-1-->L29-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~y~0.base_24)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_18) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem13_8| (select (select |v_#memory_int_37| v_ULTIMATE.start_main_~y~0.base_24) v_ULTIMATE.start_main_~y~0.offset_18))) (<= (+ v_ULTIMATE.start_main_~y~0.offset_18 4) (select |v_#length_47| v_ULTIMATE.start_main_~y~0.base_24))) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_8|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_47|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_7|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_37|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_24, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_18, #length=|v_#length_47|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 6#L29-2true [2020-07-01 12:36:25,413 INFO L796 eck$LassoCheckResult]: Loop: 6#L29-2true [121] L29-2-->L28-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_23| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem15_2|)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 60#L28-1true [352] L28-1-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~N~0.offset_11) (<= (+ v_ULTIMATE.start_main_~N~0.offset_11 4) (select |v_#length_48| v_ULTIMATE.start_main_~N~0.base_14)) (<= |v_ULTIMATE.start_main_#t~mem15_8| (select (select |v_#memory_int_38| v_ULTIMATE.start_main_~N~0.base_14) v_ULTIMATE.start_main_~N~0.offset_11)) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~N~0.base_14))) InVars {#valid=|v_#valid_58|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_11, #memory_int=|v_#memory_int_38|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_8|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_14} OutVars{#valid=|v_#valid_58|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_11, #memory_int=|v_#memory_int_38|, #length=|v_#length_48|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_7|, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_14, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem16] 7#L29true [125] L29-->L33: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 31#L33true [154] L33-->L33-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_37| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18) (= 1 (select |v_#valid_43| v_ULTIMATE.start_main_~x~0.base_25)) (= |v_ULTIMATE.start_main_#t~mem21_2| (select (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25, #valid=|v_#valid_43|} OutVars{ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_2|, #valid=|v_#valid_43|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #memory_int=|v_#memory_int_22|, #length=|v_#length_37|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem21] 29#L33-1true [348] L33-1-->L29-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_44| v_ULTIMATE.start_main_~x~0.base_32)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_54| v_ULTIMATE.start_main_~x~0.base_32)) (= (store |v_#memory_int_32| v_ULTIMATE.start_main_~x~0.base_32 (store (select |v_#memory_int_32| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~mem21_6| 1))) |v_#memory_int_31|)) InVars {ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_32|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_44|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{ULTIMATE.start_main_#t~mem21=|v_ULTIMATE.start_main_#t~mem21_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_44|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem21, #memory_int] 6#L29-2true [2020-07-01 12:36:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,414 INFO L82 PathProgramCache]: Analyzing trace with hash 733196844, now seen corresponding path program 1 times [2020-07-01 12:36:25,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717071531] [2020-07-01 12:36:25,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,435 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 12:36:25,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717071531] [2020-07-01 12:36:25,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732870959] [2020-07-01 12:36:25,437 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:36:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash 150986871, now seen corresponding path program 1 times [2020-07-01 12:36:25,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705270597] [2020-07-01 12:36:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:36:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:36:25,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:36:25,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,536 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2020-07-01 12:36:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,649 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2020-07-01 12:36:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,652 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 12:36:25,656 INFO L168 Benchmark]: Toolchain (without parser) took 2990.91 ms. Allocated memory was 649.6 MB in the beginning and 759.2 MB in the end (delta: 109.6 MB). Free memory was 561.7 MB in the beginning and 675.4 MB in the end (delta: -113.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:36:25,657 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:36:25,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.48 ms. Allocated memory was 649.6 MB in the beginning and 699.9 MB in the end (delta: 50.3 MB). Free memory was 561.7 MB in the beginning and 662.0 MB in the end (delta: -100.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.49 ms. Allocated memory is still 699.9 MB. Free memory was 662.0 MB in the beginning and 659.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,659 INFO L168 Benchmark]: Boogie Preprocessor took 26.30 ms. Allocated memory is still 699.9 MB. Free memory was 659.3 MB in the beginning and 657.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,659 INFO L168 Benchmark]: RCFGBuilder took 481.63 ms. Allocated memory is still 699.9 MB. Free memory was 657.9 MB in the beginning and 624.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,660 INFO L168 Benchmark]: BlockEncodingV2 took 147.09 ms. Allocated memory is still 699.9 MB. Free memory was 624.7 MB in the beginning and 605.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,660 INFO L168 Benchmark]: TraceAbstraction took 1676.25 ms. Allocated memory was 699.9 MB in the beginning and 759.2 MB in the end (delta: 59.2 MB). Free memory was 604.5 MB in the beginning and 717.0 MB in the end (delta: -112.6 MB). Peak memory consumption was 212.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,661 INFO L168 Benchmark]: BuchiAutomizer took 301.80 ms. Allocated memory is still 759.2 MB. Free memory was 717.0 MB in the beginning and 675.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:25,665 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 79 locations, 86 edges - StatisticsResult: Encoded RCFG 67 locations, 121 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 308.48 ms. Allocated memory was 649.6 MB in the beginning and 699.9 MB in the end (delta: 50.3 MB). Free memory was 561.7 MB in the beginning and 662.0 MB in the end (delta: -100.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.49 ms. Allocated memory is still 699.9 MB. Free memory was 662.0 MB in the beginning and 659.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.30 ms. Allocated memory is still 699.9 MB. Free memory was 659.3 MB in the beginning and 657.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 481.63 ms. Allocated memory is still 699.9 MB. Free memory was 657.9 MB in the beginning and 624.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 147.09 ms. Allocated memory is still 699.9 MB. Free memory was 624.7 MB in the beginning and 605.8 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1676.25 ms. Allocated memory was 699.9 MB in the beginning and 759.2 MB in the end (delta: 59.2 MB). Free memory was 604.5 MB in the beginning and 717.0 MB in the end (delta: -112.6 MB). Peak memory consumption was 212.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 301.80 ms. Allocated memory is still 759.2 MB. Free memory was 717.0 MB in the beginning and 675.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant [2020-07-01 12:36:25,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:25,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:25,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[y] && \valid[x] == 1) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 == \valid[N]) && 4 == unknown-#length-unknown[N]) && 0 == N) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 36 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 99 SDtfs, 564 SDslu, 4 SDs, 0 SdLazy, 489 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 12:36:19.432 ----------------------------------------------- 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_nQv_4L/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:36:25.902 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check