/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:09:08,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:09:08,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:09:08,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:09:08,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:09:08,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:09:08,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:09:08,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:09:08,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:09:08,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:09:08,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:09:08,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:09:08,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:09:08,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:09:08,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:09:08,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:09:08,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:09:08,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:09:08,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:09:08,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:09:08,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:09:08,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:09:08,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:09:08,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:09:08,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:09:08,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:09:08,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:09:08,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:09:08,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:09:08,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:09:08,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:09:08,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:09:08,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:09:08,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:09:08,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:09:08,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:09:08,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:09:08,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:09:08,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:09:08,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:09:08,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:09:08,731 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:09:08,745 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:09:08,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:09:08,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:09:08,746 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:09:08,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:09:08,747 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:08,747 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:09:08,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:09:08,747 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:09:08,748 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:09:08,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:09:08,749 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:09:08,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:09:08,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:09:08,749 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:09:08,749 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:09:08,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:09:08,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:09:08,750 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:09:08,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:08,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:09:08,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:09:08,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:09:08,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:09:08,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:09:08,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:09:08,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:09:08,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:09:08,939 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:09:08,940 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:09:09,007 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_a3dXqt/tmp/7187c7fb4fd14ca899673ec3d592f928/FLAGfe0c72f23 [2020-07-01 13:09:09,354 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:09:09,355 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:09:09,355 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:09:09,361 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_a3dXqt/tmp/7187c7fb4fd14ca899673ec3d592f928/FLAGfe0c72f23 [2020-07-01 13:09:09,803 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_a3dXqt/tmp/7187c7fb4fd14ca899673ec3d592f928 [2020-07-01 13:09:09,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:09:09,816 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:09:09,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:09,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:09:09,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:09:09,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5018a455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09, skipping insertion in model container [2020-07-01 13:09:09,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:09:09,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:09:10,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:10,082 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:09:10,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:10,113 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:09:10,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10 WrapperNode [2020-07-01 13:09:10,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:10,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:10,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:09:10,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:09:10,124 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:09:10" (1/1) ... [2020-07-01 13:09:10,132 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:09:10" (1/1) ... [2020-07-01 13:09:10,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:10,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:09:10,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:09:10,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:09:10,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:09:10,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:09:10,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:09:10,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:09:10,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:09:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:09:10,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:09:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:09:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:09:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:09:10,484 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:09:10,485 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-01 13:09:10,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:10 BoogieIcfgContainer [2020-07-01 13:09:10,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:09:10,489 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:09:10,489 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:09:10,491 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:09:10,492 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:10" (1/1) ... [2020-07-01 13:09:10,506 INFO L313 BlockEncoder]: Initial Icfg 31 locations, 34 edges [2020-07-01 13:09:10,507 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:09:10,508 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:09:10,508 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:09:10,509 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:10,511 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:09:10,511 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:09:10,512 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:09:10,533 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:09:10,560 INFO L200 BlockEncoder]: SBE split 15 edges [2020-07-01 13:09:10,564 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:09:10,566 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:10,589 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:09:10,591 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:09:10,593 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:09:10,593 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:10,597 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 13:09:10,598 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:09:10,599 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:09:10,599 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:10,599 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:09:10,600 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:09:10,601 INFO L313 BlockEncoder]: Encoded RCFG 24 locations, 42 edges [2020-07-01 13:09:10,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:10 BasicIcfg [2020-07-01 13:09:10,601 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:09:10,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:09:10,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:09:10,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:09:10,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:09:09" (1/4) ... [2020-07-01 13:09:10,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292558e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:10, skipping insertion in model container [2020-07-01 13:09:10,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (2/4) ... [2020-07-01 13:09:10,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292558e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:10, skipping insertion in model container [2020-07-01 13:09:10,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:10" (3/4) ... [2020-07-01 13:09:10,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292558e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:10, skipping insertion in model container [2020-07-01 13:09:10,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:10" (4/4) ... [2020-07-01 13:09:10,610 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:10,621 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:09:10,629 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 13:09:10,643 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 13:09:10,666 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:09:10,667 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:09:10,667 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:10,667 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:10,667 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:10,667 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:09:10,667 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:10,668 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:09:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-01 13:09:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:10,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:10,690 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash 109077, now seen corresponding path program 1 times [2020-07-01 13:09:10,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490634761] [2020-07-01 13:09:10,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,857 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:09:10,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490634761] [2020-07-01 13:09:10,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091480487] [2020-07-01 13:09:10,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,883 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-07-01 13:09:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,969 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. [2020-07-01 13:09:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,983 INFO L225 Difference]: With dead ends: 46 [2020-07-01 13:09:10,983 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:09:10,987 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:09:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:09:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:09:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:09:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-07-01 13:09:11,024 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 3 [2020-07-01 13:09:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,024 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-07-01 13:09:11,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-07-01 13:09:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:11,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:11,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:09:11,027 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 109170, now seen corresponding path program 1 times [2020-07-01 13:09:11,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351172513] [2020-07-01 13:09:11,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,062 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:09:11,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351172513] [2020-07-01 13:09:11,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237742798] [2020-07-01 13:09:11,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,066 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 3 states. [2020-07-01 13:09:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,125 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2020-07-01 13:09:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,126 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:09:11,126 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:09:11,127 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:09:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:09:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:09:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:09:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2020-07-01 13:09:11,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 3 [2020-07-01 13:09:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,133 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-07-01 13:09:11,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2020-07-01 13:09:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:11,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:11,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:09:11,134 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 109167, now seen corresponding path program 1 times [2020-07-01 13:09:11,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266366759] [2020-07-01 13:09:11,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,177 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:09:11,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266366759] [2020-07-01 13:09:11,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101486747] [2020-07-01 13:09:11,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,179 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. Second operand 3 states. [2020-07-01 13:09:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,244 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2020-07-01 13:09:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,245 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:09:11,245 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:09:11,246 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:09:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:09:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 13:09:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 13:09:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-07-01 13:09:11,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 3 [2020-07-01 13:09:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,250 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-01 13:09:11,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-01 13:09:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:11,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:11,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:09:11,251 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 109169, now seen corresponding path program 1 times [2020-07-01 13:09:11,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830619325] [2020-07-01 13:09:11,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,284 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:09:11,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830619325] [2020-07-01 13:09:11,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243418505] [2020-07-01 13:09:11,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,286 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 3 states. [2020-07-01 13:09:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,330 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-01 13:09:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,332 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:09:11,332 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:09:11,332 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:09:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:09:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 13:09:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:09:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-01 13:09:11,336 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 3 [2020-07-01 13:09:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,336 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-01 13:09:11,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-07-01 13:09:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:11,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:11,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:09:11,337 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash 3385313, now seen corresponding path program 1 times [2020-07-01 13:09:11,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757077118] [2020-07-01 13:09:11,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,365 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:09:11,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757077118] [2020-07-01 13:09:11,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566766416] [2020-07-01 13:09:11,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,367 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 3 states. [2020-07-01 13:09:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,414 INFO L93 Difference]: Finished difference Result 18 states and 27 transitions. [2020-07-01 13:09:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,415 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:09:11,415 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:09:11,416 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:09:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:09:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:09:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:09:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-01 13:09:11,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 4 [2020-07-01 13:09:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,419 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 13:09:11,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-01 13:09:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:11,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:11,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:09:11,420 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 3385315, now seen corresponding path program 1 times [2020-07-01 13:09:11,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349807191] [2020-07-01 13:09:11,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,447 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:09:11,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349807191] [2020-07-01 13:09:11,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058279095] [2020-07-01 13:09:11,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,450 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2020-07-01 13:09:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,475 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-01 13:09:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,476 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:09:11,476 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:09:11,477 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:09:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:09:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:09:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:09:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-01 13:09:11,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2020-07-01 13:09:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,480 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-01 13:09:11,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-01 13:09:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:11,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:11,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:11,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:09:11,481 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:09:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash 3385316, now seen corresponding path program 1 times [2020-07-01 13:09:11,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835196561] [2020-07-01 13:09:11,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,513 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:09:11,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835196561] [2020-07-01 13:09:11,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:11,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254518614] [2020-07-01 13:09:11,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:11,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:11,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,515 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2020-07-01 13:09:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,537 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-01 13:09:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,538 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:09:11,538 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:09:11,538 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:09:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:09:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:09:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:09:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:09:11,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 13:09:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,539 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:11,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:09:11,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:09:11,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:09:11,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:09:11,603 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,603 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,622 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,623 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point L8(lines 8 10) no Hoare annotation was computed. [2020-07-01 13:09:11,624 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:09:11,625 INFO L264 CegarLoopResult]: At program point L8-2(lines 7 10) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~x2~0.base)) (= (select |#valid| ULTIMATE.start_main_~x2~0.base) 1) (= ULTIMATE.start_main_~x2~0.offset 0) (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~x1~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x1~0.base))) [2020-07-01 13:09:11,625 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:09:11,625 INFO L268 CegarLoopResult]: For program point L8-3(lines 8 10) no Hoare annotation was computed. [2020-07-01 13:09:11,625 INFO L264 CegarLoopResult]: At program point L6-3(lines 6 12) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~x2~0.base)) (= (select |#valid| ULTIMATE.start_main_~x2~0.base) 1) (= ULTIMATE.start_main_~x2~0.offset 0) (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~x1~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x1~0.base))) [2020-07-01 13:09:11,626 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 13:09:11,628 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:09:11,637 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,647 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,647 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,647 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:11 BasicIcfg [2020-07-01 13:09:11,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:09:11,651 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:09:11,651 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:09:11,655 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:09:11,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:09:09" (1/5) ... [2020-07-01 13:09:11,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447cee93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:10" (2/5) ... [2020-07-01 13:09:11,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447cee93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:10" (3/5) ... [2020-07-01 13:09:11,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447cee93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:10" (4/5) ... [2020-07-01 13:09:11,658 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@447cee93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:11" (5/5) ... [2020-07-01 13:09:11,659 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:11,681 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:09:11,681 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:09:11,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:11,682 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:11,682 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:11,682 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:09:11,682 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:11,682 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:09:11,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-01 13:09:11,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:09:11,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:11,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:11,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:09:11,697 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,697 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:09:11,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-01 13:09:11,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-01 13:09:11,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:11,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:11,700 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:09:11,700 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,705 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue [79] 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] 18#L-1true [108] L-1-->L6-3: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= v_ULTIMATE.start_main_~x2~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~x2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~x1~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#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|) (= (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|))) 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_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_1, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_1, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_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|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~x2~0.offset, ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_~x1~0.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 25#L6-3true [2020-07-01 13:09:11,706 INFO L796 eck$LassoCheckResult]: Loop: 25#L6-3true [142] L6-3-->L7: Formula: (and (<= (+ v_ULTIMATE.start_main_~x1~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_main_~x1~0.base_14)) (<= 0 v_ULTIMATE.start_main_~x1~0.offset_11) (= (select |v_#valid_31| v_ULTIMATE.start_main_~x1~0.base_14) 1) (<= (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~x1~0.base_14) v_ULTIMATE.start_main_~x1~0.offset_11) 10)) InVars {ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_11, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_14} OutVars{ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_11, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_13|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 10#L7true [54] L7-->L8-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x2~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~x2~0.base_4)) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~x2~0.base_4)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~x2~0.base_4 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~x2~0.base_4) v_ULTIMATE.start_main_~x2~0.offset_4 10))) (<= 0 v_ULTIMATE.start_main_~x2~0.offset_4)) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 8#L8-2true [73] L8-2-->L8: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x2~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x2~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x2~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x2~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x2~0.base_7) v_ULTIMATE.start_main_~x2~0.offset_6))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_6, #length=|v_#length_8|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_6, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_7, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 12#L8true [98] L8-->L8-3: Formula: (>= 1 |v_ULTIMATE.start_main_#t~mem3_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_4|} OutVars{ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 5#L8-3true [69] L8-3-->L11: Formula: (and (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~x1~0.base_7) v_ULTIMATE.start_main_~x1~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x1~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~x1~0.base_7)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~x1~0.base_7)) (<= 0 v_ULTIMATE.start_main_~x1~0.offset_6)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_6, #length=|v_#length_14|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 22#L11true [141] L11-->L6-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x1~0.offset_10) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x1~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x1~0.offset_10 4) (select |v_#length_19| v_ULTIMATE.start_main_~x1~0.base_13)) (= |v_#memory_int_13| (store |v_#memory_int_14| v_ULTIMATE.start_main_~x1~0.base_13 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x1~0.base_13) v_ULTIMATE.start_main_~x1~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem5_6| 1))))) InVars {ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_10, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_19|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_10, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5] 25#L6-3true [2020-07-01 13:09:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash 3518, now seen corresponding path program 1 times [2020-07-01 13:09:11,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088398422] [2020-07-01 13:09:11,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:09:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash 710017162, now seen corresponding path program 1 times [2020-07-01 13:09:11,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643293544] [2020-07-01 13:09:11,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:11,771 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:09:11,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643293544] [2020-07-01 13:09:11,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:11,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:09:11,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117094442] [2020-07-01 13:09:11,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:09:11,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:11,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:09:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:09:11,775 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2020-07-01 13:09:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,931 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2020-07-01 13:09:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:09:11,935 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:09:11,940 INFO L168 Benchmark]: Toolchain (without parser) took 2123.28 ms. Allocated memory was 514.9 MB in the beginning and 583.5 MB in the end (delta: 68.7 MB). Free memory was 438.2 MB in the beginning and 506.4 MB in the end (delta: -68.2 MB). Peak memory consumption was 455.6 kB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,940 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:09:11,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.27 ms. Allocated memory was 514.9 MB in the beginning and 555.7 MB in the end (delta: 40.9 MB). Free memory was 438.2 MB in the beginning and 523.2 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 555.7 MB. Free memory was 523.2 MB in the beginning and 521.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,942 INFO L168 Benchmark]: Boogie Preprocessor took 23.80 ms. Allocated memory is still 555.7 MB. Free memory was 521.5 MB in the beginning and 519.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,943 INFO L168 Benchmark]: RCFGBuilder took 311.85 ms. Allocated memory is still 555.7 MB. Free memory was 519.9 MB in the beginning and 501.3 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,943 INFO L168 Benchmark]: BlockEncodingV2 took 112.12 ms. Allocated memory is still 555.7 MB. Free memory was 501.3 MB in the beginning and 492.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,944 INFO L168 Benchmark]: TraceAbstraction took 1048.42 ms. Allocated memory was 555.7 MB in the beginning and 583.5 MB in the end (delta: 27.8 MB). Free memory was 491.5 MB in the beginning and 537.7 MB in the end (delta: -46.1 MB). Peak memory consumption was 107.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,944 INFO L168 Benchmark]: BuchiAutomizer took 285.80 ms. Allocated memory is still 583.5 MB. Free memory was 535.7 MB in the beginning and 506.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:11,948 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 34 edges - StatisticsResult: Encoded RCFG 24 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 297.27 ms. Allocated memory was 514.9 MB in the beginning and 555.7 MB in the end (delta: 40.9 MB). Free memory was 438.2 MB in the beginning and 523.2 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 555.7 MB. Free memory was 523.2 MB in the beginning and 521.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.80 ms. Allocated memory is still 555.7 MB. Free memory was 521.5 MB in the beginning and 519.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 311.85 ms. Allocated memory is still 555.7 MB. Free memory was 519.9 MB in the beginning and 501.3 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 112.12 ms. Allocated memory is still 555.7 MB. Free memory was 501.3 MB in the beginning and 492.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1048.42 ms. Allocated memory was 555.7 MB in the beginning and 583.5 MB in the end (delta: 27.8 MB). Free memory was 491.5 MB in the beginning and 537.7 MB in the end (delta: -46.1 MB). Peak memory consumption was 107.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 285.80 ms. Allocated memory is still 583.5 MB. Free memory was 535.7 MB in the beginning and 506.4 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 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 #StackHeapBarrier - 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 #StackHeapBarrier - 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: 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: 6]: 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: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: 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: 7]: 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: 8]: 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-07-01 13:09:11,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((4 == unknown-#length-unknown[x2] && \valid[x2] == 1) && x2 == 0) && 1 <= unknown-#StackHeapBarrier-unknown) && x1 == 0) && 1 == \valid[x1]) && 4 == unknown-#length-unknown[x1] - InvariantResult [Line: 6]: Loop Invariant [2020-07-01 13:09:11,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((4 == unknown-#length-unknown[x2] && \valid[x2] == 1) && x2 == 0) && 1 <= unknown-#StackHeapBarrier-unknown) && x1 == 0) && 1 == \valid[x1]) && 4 == unknown-#length-unknown[x1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.8s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 161 SDslu, 4 SDs, 0 SdLazy, 151 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 60 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:09:06.466 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_a3dXqt/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:09:12.186 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check