/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:05:20,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:05:20,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:05:20,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:05:20,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:05:20,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:05:20,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:05:20,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:05:20,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:05:20,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:05:20,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:05:20,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:05:20,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:05:20,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:05:20,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:05:20,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:05:20,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:05:20,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:05:20,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:05:20,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:05:20,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:05:20,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:05:20,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:05:20,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:05:20,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:05:20,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:05:20,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:05:20,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:05:20,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:05:20,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:05:20,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:05:20,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:05:20,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:05:20,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:05:20,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:05:20,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:05:20,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:05:20,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:05:20,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:05:20,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:05:20,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:05:20,736 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:05:20,750 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:05:20,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:05:20,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:05:20,751 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:05:20,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:05:20,752 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:20,752 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:05:20,752 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:05:20,752 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:05:20,752 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:05:20,753 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:05:20,753 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:05:20,753 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:05:20,753 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:05:20,753 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:05:20,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:05:20,754 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:05:20,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:05:20,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:05:20,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:05:20,754 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:05:20,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:05:20,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:05:20,755 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:05:20,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:05:20,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:05:20,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:05:20,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:05:20,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:05:20,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:05:20,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:05:20,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:05:20,944 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:05:20,945 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:05:20,946 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:05:21,007 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_uTuov4/tmp/3750232863eb46ea9907d0e3c8d85bec/FLAG431b309f1 [2020-07-01 13:05:21,343 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:05:21,344 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:05:21,344 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:05:21,351 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_uTuov4/tmp/3750232863eb46ea9907d0e3c8d85bec/FLAG431b309f1 [2020-07-01 13:05:21,751 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_uTuov4/tmp/3750232863eb46ea9907d0e3c8d85bec [2020-07-01 13:05:21,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:05:21,764 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:05:21,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:21,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:05:21,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:05:21,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e599e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:21, skipping insertion in model container [2020-07-01 13:05:21,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:05:21" (1/1) ... [2020-07-01 13:05:21,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:05:21,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:05:22,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:22,034 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:05:22,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:05:22,067 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:05:22,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22 WrapperNode [2020-07-01 13:05:22,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:05:22,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:22,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:05:22,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:05:22,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:05:22,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:05:22,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:05:22,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:05:22,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:05:22,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:05:22,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:05:22,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:05:22,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:05:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:05:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:05:22,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:05:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:05:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:05:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:05:22,521 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:05:22,522 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:05:22,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22 BoogieIcfgContainer [2020-07-01 13:05:22,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:05:22,527 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:05:22,527 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:05:22,529 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:05:22,530 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (1/1) ... [2020-07-01 13:05:22,548 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 63 edges [2020-07-01 13:05:22,550 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:05:22,550 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:05:22,551 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:05:22,551 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:05:22,553 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:05:22,554 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:05:22,554 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:05:22,583 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:05:22,618 INFO L200 BlockEncoder]: SBE split 34 edges [2020-07-01 13:05:22,623 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:05:22,625 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:22,652 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:05:22,654 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 13:05:22,656 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:05:22,656 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:05:22,656 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:05:22,657 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:05:22,658 INFO L313 BlockEncoder]: Encoded RCFG 50 locations, 89 edges [2020-07-01 13:05:22,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22 BasicIcfg [2020-07-01 13:05:22,658 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:05:22,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:05:22,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:05:22,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:05:22,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:05:21" (1/4) ... [2020-07-01 13:05:22,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (2/4) ... [2020-07-01 13:05:22,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (3/4) ... [2020-07-01 13:05:22,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea31f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:22, skipping insertion in model container [2020-07-01 13:05:22,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22" (4/4) ... [2020-07-01 13:05:22,667 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:22,677 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:05:22,685 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 13:05:22,699 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 13:05:22,722 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:05:22,723 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:05:22,723 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:22,723 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:22,723 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:22,723 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:05:22,723 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:22,724 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:05:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-01 13:05:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:22,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:22,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:22,746 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 151932, now seen corresponding path program 1 times [2020-07-01 13:05:22,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:22,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264438120] [2020-07-01 13:05:22,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:22,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264438120] [2020-07-01 13:05:22,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:22,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:22,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572650556] [2020-07-01 13:05:22,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:22,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:22,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:22,938 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 13:05:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,108 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2020-07-01 13:05:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,124 INFO L225 Difference]: With dead ends: 98 [2020-07-01 13:05:23,124 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 13:05:23,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 13:05:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 13:05:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 13:05:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-07-01 13:05:23,169 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 3 [2020-07-01 13:05:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,169 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-07-01 13:05:23,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-07-01 13:05:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:23,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:23,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:05:23,172 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash 152025, now seen corresponding path program 1 times [2020-07-01 13:05:23,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559326183] [2020-07-01 13:05:23,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:23,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559326183] [2020-07-01 13:05:23,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862926978] [2020-07-01 13:05:23,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,226 INFO L87 Difference]: Start difference. First operand 50 states and 85 transitions. Second operand 3 states. [2020-07-01 13:05:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,368 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2020-07-01 13:05:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,370 INFO L225 Difference]: With dead ends: 50 [2020-07-01 13:05:23,370 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:05:23,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:05:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:05:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:05:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2020-07-01 13:05:23,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 3 [2020-07-01 13:05:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,378 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2020-07-01 13:05:23,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2020-07-01 13:05:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:05:23,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:05:23,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:05:23,379 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash 152027, now seen corresponding path program 1 times [2020-07-01 13:05:23,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516695995] [2020-07-01 13:05:23,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:23,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516695995] [2020-07-01 13:05:23,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576799806] [2020-07-01 13:05:23,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,423 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2020-07-01 13:05:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,530 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2020-07-01 13:05:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:05:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,531 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:05:23,532 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:05:23,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:05:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:05:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:05:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-07-01 13:05:23,538 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 3 [2020-07-01 13:05:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,538 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-07-01 13:05:23,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-07-01 13:05:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:05:23,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:05:23,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:05:23,539 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 4715075, now seen corresponding path program 1 times [2020-07-01 13:05:23,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713143821] [2020-07-01 13:05:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:23,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713143821] [2020-07-01 13:05:23,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376064528] [2020-07-01 13:05:23,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,584 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2020-07-01 13:05:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,697 INFO L93 Difference]: Finished difference Result 40 states and 65 transitions. [2020-07-01 13:05:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:05:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,698 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:05:23,698 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 13:05:23,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 13:05:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 13:05:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:05:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2020-07-01 13:05:23,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 4 [2020-07-01 13:05:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,704 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2020-07-01 13:05:23,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2020-07-01 13:05:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:05:23,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:05:23,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:05:23,705 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash 4715076, now seen corresponding path program 1 times [2020-07-01 13:05:23,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084330924] [2020-07-01 13:05:23,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:23,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084330924] [2020-07-01 13:05:23,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:23,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450839751] [2020-07-01 13:05:23,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,739 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 3 states. [2020-07-01 13:05:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,830 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2020-07-01 13:05:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:05:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,832 INFO L225 Difference]: With dead ends: 37 [2020-07-01 13:05:23,832 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:05:23,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:05:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:05:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:05:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. [2020-07-01 13:05:23,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 4 [2020-07-01 13:05:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,837 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 53 transitions. [2020-07-01 13:05:23,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. [2020-07-01 13:05:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:05:23,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:05:23,838 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 3097311, now seen corresponding path program 1 times [2020-07-01 13:05:23,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448778934] [2020-07-01 13:05:23,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:23,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448778934] [2020-07-01 13:05:23,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:23,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:23,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358635336] [2020-07-01 13:05:23,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:23,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,876 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand 3 states. [2020-07-01 13:05:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:23,963 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2020-07-01 13:05:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:23,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 13:05:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:23,964 INFO L225 Difference]: With dead ends: 63 [2020-07-01 13:05:23,964 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:05:23,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:05:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:05:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:05:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2020-07-01 13:05:23,968 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 10 [2020-07-01 13:05:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:23,969 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2020-07-01 13:05:23,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2020-07-01 13:05:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 13:05:23,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:23,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:23,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:05:23,970 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash -209584567, now seen corresponding path program 1 times [2020-07-01 13:05:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:23,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811235359] [2020-07-01 13:05:23,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:24,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811235359] [2020-07-01 13:05:24,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:24,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096875017] [2020-07-01 13:05:24,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:24,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,015 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 3 states. [2020-07-01 13:05:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,078 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2020-07-01 13:05:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 13:05:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:24,079 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:05:24,079 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:05:24,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:05:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:05:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:05:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-01 13:05:24,083 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-07-01 13:05:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:24,084 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-01 13:05:24,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-01 13:05:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 13:05:24,084 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:05:24,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:05:24,085 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.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:05:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -209584565, now seen corresponding path program 1 times [2020-07-01 13:05:24,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007243671] [2020-07-01 13:05:24,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:24,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007243671] [2020-07-01 13:05:24,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:05:24,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004636513] [2020-07-01 13:05:24,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:05:24,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,131 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2020-07-01 13:05:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,180 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-07-01 13:05:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 13:05:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:05:24,181 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:05:24,181 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:05:24,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:05:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:05:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:05:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:05:24,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-01 13:05:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:05:24,183 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:05:24,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:05:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:05:24,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:05:24,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:05:24,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:05:24,220 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,220 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,220 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 19) no Hoare annotation was computed. [2020-07-01 13:05:24,220 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-3(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-4(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-5(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L11-7(lines 11 21) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,221 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:05:24,222 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:05:24,223 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:05:24,224 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,225 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:05:24,225 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:05:24,225 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:05:24,225 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:05:24,225 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L264 CegarLoopResult]: At program point L18-1(lines 14 20) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~maxId~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~maxId~0.base)) (= 0 ULTIMATE.start_main_~tmp~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~maxId~0.base)) (= (select |#length| ULTIMATE.start_main_~id~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_main_~tmp~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~id~0.base)) (= ULTIMATE.start_main_~id~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~tmp~0.base)) (<= 1 |#StackHeapBarrier|)) [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 20) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:05:24,226 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:05:24,227 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:05:24,229 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:05:24,238 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,239 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:24 BasicIcfg [2020-07-01 13:05:24,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:05:24,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:05:24,249 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:05:24,253 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:05:24,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:05:21" (1/5) ... [2020-07-01 13:05:24,254 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ddd71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:05:22" (2/5) ... [2020-07-01 13:05:24,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ddd71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:05:22" (3/5) ... [2020-07-01 13:05:24,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ddd71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:05:22" (4/5) ... [2020-07-01 13:05:24,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ddd71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:05:24, skipping insertion in model container [2020-07-01 13:05:24,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:05:24,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:05:24" (5/5) ... [2020-07-01 13:05:24,257 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:05:24,278 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:05:24,278 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:05:24,279 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:05:24,279 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:05:24,279 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:05:24,279 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:05:24,279 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:05:24,279 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:05:24,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 13:05:24,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:05:24,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:24,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:24,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,294 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:05:24,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 13:05:24,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:05:24,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:05:24,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:05:24,297 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:05:24,303 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [121] 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] 13#L-1true [186] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~id~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~maxId~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~id~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~maxId~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_1, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_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_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_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~short7=|v_ULTIMATE.start_main_#t~short7_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_1, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_1|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~maxId~0.base, ULTIMATE.start_main_~tmp~0.offset, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~tmp~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~id~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~maxId~0.offset, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~id~0.offset, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 24#L8true [255] L8-->L9: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~id~0.base_19) v_ULTIMATE.start_main_~id~0.offset_14 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_20|) (= 1 (select |v_#valid_41| v_ULTIMATE.start_main_~id~0.base_19)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_14) (<= (+ v_ULTIMATE.start_main_~id~0.offset_14 4) (select |v_#length_34| v_ULTIMATE.start_main_~id~0.base_19))) InVars {ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_19, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_14, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 40#L9true [256] L9-->L11: Formula: (and (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_10 4) (select |v_#length_35| v_ULTIMATE.start_main_~maxId~0.base_13)) (= 1 (select |v_#valid_42| v_ULTIMATE.start_main_~maxId~0.base_13)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_10) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~maxId~0.base_13) v_ULTIMATE.start_main_~maxId~0.offset_10 |v_ULTIMATE.start_main_#t~nondet3_5|)))) InVars {ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_10, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 28#L11true [122] L11-->L11-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~id~0.base_7)) (<= (+ v_ULTIMATE.start_main_~id~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~id~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~id~0.base_7) v_ULTIMATE.start_main_~id~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_6)) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_6, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 26#L11-1true [200] L11-1-->L11-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem4_3|) |v_ULTIMATE.start_main_#t~short7_2|) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_2|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short7] 12#L11-2true [101] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_main_#t~short7_5|) InVars {ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} OutVars{ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_5|} AuxVars[] AssignedVars[] 20#L11-7true [206] L11-7-->L13: Formula: (and (= 0 (select |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) |v_ULTIMATE.start_main_#t~short7_7| (= |v_#length_14| (store |v_#length_15| |v_ULTIMATE.start_main_#t~malloc8.base_2| 4)) (> 0 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= v_ULTIMATE.start_main_~tmp~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= (store |v_#valid_17| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1) |v_#valid_16|) (= 0 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (= v_ULTIMATE.start_main_~tmp~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_15|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_7|, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_2, #valid=|v_#valid_16|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_4|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|, ULTIMATE.start_main_#t~short7=|v_ULTIMATE.start_main_#t~short7_6|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_~tmp~0.base, ULTIMATE.start_main_~tmp~0.offset, #valid, ULTIMATE.start_main_#t~malloc8.offset, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~short7, ULTIMATE.start_main_#t~mem4] 51#L13true [146] L13-->L13-1: Formula: (and (= (select |v_#valid_18| v_ULTIMATE.start_main_~id~0.base_13) 1) (= |v_ULTIMATE.start_main_#t~mem9_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~id~0.base_13) v_ULTIMATE.start_main_~id~0.offset_10)) (<= 0 v_ULTIMATE.start_main_~id~0.offset_10) (<= (+ v_ULTIMATE.start_main_~id~0.offset_10 4) (select |v_#length_16| v_ULTIMATE.start_main_~id~0.base_13))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #length=|v_#length_16|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_13, #valid=|v_#valid_18|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_10, #memory_int=|v_#memory_int_8|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 50#L13-1true [259] L13-1-->L18-1: Formula: (and (= 1 (select |v_#valid_47| v_ULTIMATE.start_main_~tmp~0.base_21)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_15) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_15 4) (select |v_#length_36| v_ULTIMATE.start_main_~tmp~0.base_21)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~tmp~0.base_21) v_ULTIMATE.start_main_~tmp~0.offset_15 (+ |v_ULTIMATE.start_main_#t~mem9_6| 1))) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_6|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_21, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_15, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9, #memory_int] 7#L18-1true [2020-07-01 13:05:24,304 INFO L796 eck$LassoCheckResult]: Loop: 7#L18-1true [88] L18-1-->L14-1: Formula: (and (= (select |v_#valid_22| v_ULTIMATE.start_main_~tmp~0.base_6) 1) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_5) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_main_~tmp~0.base_6)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_main_~tmp~0.base_6) v_ULTIMATE.start_main_~tmp~0.offset_5) |v_ULTIMATE.start_main_#t~mem10_2|)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, #length=|v_#length_20|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_6, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_5, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 19#L14-1true [107] L14-1-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~id~0.offset_12) (<= (+ v_ULTIMATE.start_main_~id~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~id~0.base_16)) (= |v_ULTIMATE.start_main_#t~mem11_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~id~0.base_16) v_ULTIMATE.start_main_~id~0.offset_12)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~id~0.base_16))) InVars {ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #length=|v_#length_22|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, ULTIMATE.start_main_~id~0.base=v_ULTIMATE.start_main_~id~0.base_16, #valid=|v_#valid_24|, ULTIMATE.start_main_~id~0.offset=v_ULTIMATE.start_main_~id~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 16#L14-2true [231] L14-2-->L15: Formula: (and (> |v_ULTIMATE.start_main_#t~nondet12_5| 0) (< |v_ULTIMATE.start_main_#t~mem11_6| |v_ULTIMATE.start_main_#t~mem10_6|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_6|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~nondet12] 21#L15true [113] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_main_~tmp~0.base_9)) (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_7) (= 1 (select |v_#valid_26| v_ULTIMATE.start_main_~tmp~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~tmp~0.base_9) v_ULTIMATE.start_main_~tmp~0.offset_7) |v_ULTIMATE.start_main_#t~mem13_2|)) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, #length=|v_#length_24|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_9, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 32#L15-1true [128] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~maxId~0.offset_8 4) (select |v_#length_26| v_ULTIMATE.start_main_~maxId~0.base_10)) (<= 0 v_ULTIMATE.start_main_~maxId~0.offset_8) (= 1 (select |v_#valid_28| v_ULTIMATE.start_main_~maxId~0.base_10)) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~maxId~0.base_10) v_ULTIMATE.start_main_~maxId~0.offset_8) |v_ULTIMATE.start_main_#t~mem14_2|)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_main_~maxId~0.base=v_ULTIMATE.start_main_~maxId~0.base_10, ULTIMATE.start_main_~maxId~0.offset=v_ULTIMATE.start_main_~maxId~0.offset_8, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 31#L15-2true [176] L15-2-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem13_6| |v_ULTIMATE.start_main_#t~mem14_6|) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_6|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~mem14] 9#L18true [94] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~tmp~0.offset_13) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~tmp~0.base_18)) (= (store |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18 (store (select |v_#memory_int_19| v_ULTIMATE.start_main_~tmp~0.base_18) v_ULTIMATE.start_main_~tmp~0.offset_13 0)) |v_#memory_int_18|) (<= (+ v_ULTIMATE.start_main_~tmp~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_main_~tmp~0.base_18))) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~tmp~0.base=v_ULTIMATE.start_main_~tmp~0.base_18, #length=|v_#length_32|, ULTIMATE.start_main_~tmp~0.offset=v_ULTIMATE.start_main_~tmp~0.offset_13, #valid=|v_#valid_34|} AuxVars[] AssignedVars[#memory_int] 7#L18-1true [2020-07-01 13:05:24,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash 4021835, now seen corresponding path program 1 times [2020-07-01 13:05:24,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451375775] [2020-07-01 13:05:24,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:05:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:05:24,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451375775] [2020-07-01 13:05:24,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:05:24,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:05:24,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295884957] [2020-07-01 13:05:24,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:05:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:05:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1518903088, now seen corresponding path program 1 times [2020-07-01 13:05:24,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:05:24,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034531001] [2020-07-01 13:05:24,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:05:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:05:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:05:24,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:05:24,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:05:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:05:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:05:24,479 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 13:05:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:05:24,609 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. [2020-07-01 13:05:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:05:24,631 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:05:24,636 INFO L168 Benchmark]: Toolchain (without parser) took 2871.42 ms. Allocated memory was 514.9 MB in the beginning and 585.6 MB in the end (delta: 70.8 MB). Free memory was 438.6 MB in the beginning and 399.4 MB in the end (delta: 39.3 MB). Peak memory consumption was 110.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,636 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:05:24,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.79 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 438.0 MB in the beginning and 522.9 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.37 ms. Allocated memory is still 556.3 MB. Free memory was 522.9 MB in the beginning and 520.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,638 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 556.3 MB. Free memory was 520.9 MB in the beginning and 519.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,639 INFO L168 Benchmark]: RCFGBuilder took 391.84 ms. Allocated memory is still 556.3 MB. Free memory was 519.5 MB in the beginning and 493.4 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,639 INFO L168 Benchmark]: BlockEncodingV2 took 131.64 ms. Allocated memory is still 556.3 MB. Free memory was 493.4 MB in the beginning and 482.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,640 INFO L168 Benchmark]: TraceAbstraction took 1589.21 ms. Allocated memory was 556.3 MB in the beginning and 585.6 MB in the end (delta: 29.4 MB). Free memory was 481.2 MB in the beginning and 448.6 MB in the end (delta: 32.7 MB). Peak memory consumption was 62.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,640 INFO L168 Benchmark]: BuchiAutomizer took 384.22 ms. Allocated memory is still 585.6 MB. Free memory was 448.6 MB in the beginning and 399.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:05:24,645 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 59 locations, 63 edges - StatisticsResult: Encoded RCFG 50 locations, 89 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.79 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 438.0 MB in the beginning and 522.9 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.37 ms. Allocated memory is still 556.3 MB. Free memory was 522.9 MB in the beginning and 520.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 556.3 MB. Free memory was 520.9 MB in the beginning and 519.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 391.84 ms. Allocated memory is still 556.3 MB. Free memory was 519.5 MB in the beginning and 493.4 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 131.64 ms. Allocated memory is still 556.3 MB. Free memory was 493.4 MB in the beginning and 482.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1589.21 ms. Allocated memory was 556.3 MB in the beginning and 585.6 MB in the end (delta: 29.4 MB). Free memory was 481.2 MB in the beginning and 448.6 MB in the end (delta: 32.7 MB). Peak memory consumption was 62.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 384.22 ms. Allocated memory is still 585.6 MB. Free memory was 448.6 MB in the beginning and 399.4 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:05:24,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:05:24,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:05:24,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((0 == maxId && 4 == unknown-#length-unknown[maxId]) && 0 == tmp) && 1 == \valid[maxId]) && unknown-#length-unknown[id] == 4) && 1 == \valid[tmp]) && 1 == \valid[id]) && id == 0) && 4 == unknown-#length-unknown[tmp]) && 1 <= unknown-#StackHeapBarrier-unknown - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 67 SDtfs, 362 SDslu, 54 SDs, 0 SdLazy, 440 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 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 13:05:18.524 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_uTuov4/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:05:24.882 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check