/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 10:34:22,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 10:34:22,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 10:34:22,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 10:34:22,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 10:34:22,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 10:34:22,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 10:34:22,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 10:34:22,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 10:34:22,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 10:34:22,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 10:34:22,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 10:34:22,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 10:34:22,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 10:34:22,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 10:34:22,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 10:34:22,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 10:34:22,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 10:34:22,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 10:34:22,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 10:34:22,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 10:34:22,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 10:34:22,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 10:34:22,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 10:34:22,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 10:34:22,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 10:34:22,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 10:34:22,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 10:34:22,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 10:34:22,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 10:34:22,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 10:34:22,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 10:34:22,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 10:34:22,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 10:34:22,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 10:34:22,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 10:34:22,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 10:34:22,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 10:34:22,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 10:34:22,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 10:34:22,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 10:34:22,780 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 10:34:22,795 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 10:34:22,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 10:34:22,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 10:34:22,796 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 10:34:22,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 10:34:22,797 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:34:22,797 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 10:34:22,797 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 10:34:22,797 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 10:34:22,797 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 10:34:22,798 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 10:34:22,798 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 10:34:22,798 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 10:34:22,798 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 10:34:22,798 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:34:22,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 10:34:22,799 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 10:34:22,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 10:34:22,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 10:34:22,799 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 10:34:22,799 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 10:34:22,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 10:34:22,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 10:34:22,800 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 10:34:22,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:34:22,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 10:34:22,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 10:34:22,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 10:34:22,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 10:34:22,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 10:34:22,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 10:34:22,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 10:34:22,989 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 10:34:22,990 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 10:34:22,990 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 10:34:23,053 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_zt5kht/tmp/2d51d23477d843e0a695a4c3ff0e05ba/FLAG79bad4ed5 [2020-07-01 10:34:23,389 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 10:34:23,390 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 10:34:23,390 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 10:34:23,397 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_zt5kht/tmp/2d51d23477d843e0a695a4c3ff0e05ba/FLAG79bad4ed5 [2020-07-01 10:34:23,787 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_zt5kht/tmp/2d51d23477d843e0a695a4c3ff0e05ba [2020-07-01 10:34:23,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 10:34:23,799 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 10:34:23,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 10:34:23,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 10:34:23,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 10:34:23,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:34:23" (1/1) ... [2020-07-01 10:34:23,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c067878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:23, skipping insertion in model container [2020-07-01 10:34:23,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:34:23" (1/1) ... [2020-07-01 10:34:23,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 10:34:23,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 10:34:24,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:34:24,073 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 10:34:24,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:34:24,107 INFO L208 MainTranslator]: Completed translation [2020-07-01 10:34:24,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24 WrapperNode [2020-07-01 10:34:24,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 10:34:24,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 10:34:24,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 10:34:24,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 10:34:24,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 10:34:24,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 10:34:24,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 10:34:24,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 10:34:24,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 10:34:24,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 10:34:24,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 10:34:24,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 10:34:24,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:34:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 10:34:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 10:34:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 10:34:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 10:34:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 10:34:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 10:34:24,559 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 10:34:24,559 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 10:34:24,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:34:24 BoogieIcfgContainer [2020-07-01 10:34:24,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 10:34:24,565 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 10:34:24,565 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 10:34:24,567 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 10:34:24,568 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:34:24" (1/1) ... [2020-07-01 10:34:24,587 INFO L313 BlockEncoder]: Initial Icfg 55 locations, 59 edges [2020-07-01 10:34:24,588 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 10:34:24,589 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 10:34:24,590 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 10:34:24,590 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:34:24,592 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 10:34:24,593 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 10:34:24,593 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 10:34:24,621 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 10:34:24,665 INFO L200 BlockEncoder]: SBE split 35 edges [2020-07-01 10:34:24,670 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 10:34:24,672 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:34:24,684 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 10:34:24,686 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 10:34:24,688 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:34:24,688 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:34:24,692 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 10:34:24,693 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:34:24,693 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:34:24,694 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:34:24,694 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 10:34:24,694 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:34:24,695 INFO L313 BlockEncoder]: Encoded RCFG 50 locations, 101 edges [2020-07-01 10:34:24,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:34:24 BasicIcfg [2020-07-01 10:34:24,696 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 10:34:24,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 10:34:24,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 10:34:24,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 10:34:24,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 10:34:23" (1/4) ... [2020-07-01 10:34:24,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2399b5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:34:24, skipping insertion in model container [2020-07-01 10:34:24,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (2/4) ... [2020-07-01 10:34:24,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2399b5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:34:24, skipping insertion in model container [2020-07-01 10:34:24,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:34:24" (3/4) ... [2020-07-01 10:34:24,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2399b5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:34:24, skipping insertion in model container [2020-07-01 10:34:24,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:34:24" (4/4) ... [2020-07-01 10:34:24,704 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:34:24,715 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 10:34:24,722 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-01 10:34:24,736 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-01 10:34:24,759 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 10:34:24,760 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 10:34:24,760 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:34:24,760 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:34:24,760 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:34:24,760 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 10:34:24,760 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:34:24,760 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 10:34:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-01 10:34:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:34:24,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:24,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:34:24,784 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 130516, now seen corresponding path program 1 times [2020-07-01 10:34:24,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:24,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612952618] [2020-07-01 10:34:24,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:24,971 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 10:34:24,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612952618] [2020-07-01 10:34:24,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:24,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:24,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911261575] [2020-07-01 10:34:24,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:24,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:24,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:24,997 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 10:34:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:25,225 INFO L93 Difference]: Finished difference Result 54 states and 101 transitions. [2020-07-01 10:34:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:25,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:34:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:25,241 INFO L225 Difference]: With dead ends: 54 [2020-07-01 10:34:25,241 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 10:34:25,245 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 10:34:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 10:34:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 10:34:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 10:34:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-07-01 10:34:25,294 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 3 [2020-07-01 10:34:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:25,295 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-07-01 10:34:25,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-07-01 10:34:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:34:25,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:25,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:34:25,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 10:34:25,298 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 130517, now seen corresponding path program 1 times [2020-07-01 10:34:25,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:25,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373345823] [2020-07-01 10:34:25,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:25,360 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 10:34:25,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373345823] [2020-07-01 10:34:25,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:25,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:25,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600290621] [2020-07-01 10:34:25,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:25,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:25,364 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 3 states. [2020-07-01 10:34:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:25,588 INFO L93 Difference]: Finished difference Result 50 states and 97 transitions. [2020-07-01 10:34:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:25,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:34:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:25,590 INFO L225 Difference]: With dead ends: 50 [2020-07-01 10:34:25,590 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 10:34:25,591 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 10:34:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 10:34:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 10:34:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 10:34:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 93 transitions. [2020-07-01 10:34:25,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 93 transitions. Word has length 3 [2020-07-01 10:34:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:25,598 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 93 transitions. [2020-07-01 10:34:25,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 93 transitions. [2020-07-01 10:34:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:34:25,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:25,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:34:25,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 10:34:25,599 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 130514, now seen corresponding path program 1 times [2020-07-01 10:34:25,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:25,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825977796] [2020-07-01 10:34:25,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:25,640 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 10:34:25,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825977796] [2020-07-01 10:34:25,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:25,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:25,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363827879] [2020-07-01 10:34:25,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:25,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:25,642 INFO L87 Difference]: Start difference. First operand 46 states and 93 transitions. Second operand 3 states. [2020-07-01 10:34:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:25,836 INFO L93 Difference]: Finished difference Result 46 states and 93 transitions. [2020-07-01 10:34:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:25,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:34:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:25,837 INFO L225 Difference]: With dead ends: 46 [2020-07-01 10:34:25,837 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 10:34:25,838 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 10:34:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 10:34:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 10:34:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 10:34:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 85 transitions. [2020-07-01 10:34:25,844 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 85 transitions. Word has length 3 [2020-07-01 10:34:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:25,844 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 85 transitions. [2020-07-01 10:34:25,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 85 transitions. [2020-07-01 10:34:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:34:25,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:25,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:34:25,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 10:34:25,845 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 4043772, now seen corresponding path program 1 times [2020-07-01 10:34:25,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:25,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235269634] [2020-07-01 10:34:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:25,884 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 10:34:25,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235269634] [2020-07-01 10:34:25,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:25,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:25,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776814659] [2020-07-01 10:34:25,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:25,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:25,886 INFO L87 Difference]: Start difference. First operand 42 states and 85 transitions. Second operand 3 states. [2020-07-01 10:34:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,051 INFO L93 Difference]: Finished difference Result 42 states and 85 transitions. [2020-07-01 10:34:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:34:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,052 INFO L225 Difference]: With dead ends: 42 [2020-07-01 10:34:26,053 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 10:34:26,053 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 10:34:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 10:34:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 10:34:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 10:34:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 77 transitions. [2020-07-01 10:34:26,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 77 transitions. Word has length 4 [2020-07-01 10:34:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,058 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 77 transitions. [2020-07-01 10:34:26,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 77 transitions. [2020-07-01 10:34:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:34:26,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:34:26,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 10:34:26,059 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 4043774, now seen corresponding path program 1 times [2020-07-01 10:34:26,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659491171] [2020-07-01 10:34:26,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,088 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 10:34:26,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659491171] [2020-07-01 10:34:26,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416894641] [2020-07-01 10:34:26,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,090 INFO L87 Difference]: Start difference. First operand 38 states and 77 transitions. Second operand 3 states. [2020-07-01 10:34:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,197 INFO L93 Difference]: Finished difference Result 42 states and 77 transitions. [2020-07-01 10:34:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:34:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,199 INFO L225 Difference]: With dead ends: 42 [2020-07-01 10:34:26,199 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 10:34:26,199 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 10:34:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 10:34:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 10:34:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 10:34:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 73 transitions. [2020-07-01 10:34:26,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 73 transitions. Word has length 4 [2020-07-01 10:34:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,204 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 73 transitions. [2020-07-01 10:34:26,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 73 transitions. [2020-07-01 10:34:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 10:34:26,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 10:34:26,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 10:34:26,205 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 4043775, now seen corresponding path program 1 times [2020-07-01 10:34:26,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342265719] [2020-07-01 10:34:26,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,245 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 10:34:26,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342265719] [2020-07-01 10:34:26,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820674152] [2020-07-01 10:34:26,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,247 INFO L87 Difference]: Start difference. First operand 38 states and 73 transitions. Second operand 3 states. [2020-07-01 10:34:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,374 INFO L93 Difference]: Finished difference Result 38 states and 73 transitions. [2020-07-01 10:34:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 10:34:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,376 INFO L225 Difference]: With dead ends: 38 [2020-07-01 10:34:26,376 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 10:34:26,376 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 10:34:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 10:34:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 10:34:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 10:34:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. [2020-07-01 10:34:26,380 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 69 transitions. Word has length 4 [2020-07-01 10:34:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,380 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 69 transitions. [2020-07-01 10:34:26,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 69 transitions. [2020-07-01 10:34:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:34:26,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:34:26,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 10:34:26,382 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 125354557, now seen corresponding path program 1 times [2020-07-01 10:34:26,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580364376] [2020-07-01 10:34:26,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,414 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 10:34:26,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580364376] [2020-07-01 10:34:26,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067535948] [2020-07-01 10:34:26,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,416 INFO L87 Difference]: Start difference. First operand 34 states and 69 transitions. Second operand 3 states. [2020-07-01 10:34:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,515 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-07-01 10:34:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:34:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,516 INFO L225 Difference]: With dead ends: 34 [2020-07-01 10:34:26,517 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 10:34:26,517 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 10:34:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 10:34:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 10:34:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 10:34:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 61 transitions. [2020-07-01 10:34:26,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 61 transitions. Word has length 5 [2020-07-01 10:34:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,521 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 61 transitions. [2020-07-01 10:34:26,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 61 transitions. [2020-07-01 10:34:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:34:26,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:34:26,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 10:34:26,522 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash 125354559, now seen corresponding path program 1 times [2020-07-01 10:34:26,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636993562] [2020-07-01 10:34:26,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,549 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 10:34:26,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636993562] [2020-07-01 10:34:26,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660311436] [2020-07-01 10:34:26,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,551 INFO L87 Difference]: Start difference. First operand 30 states and 61 transitions. Second operand 3 states. [2020-07-01 10:34:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,638 INFO L93 Difference]: Finished difference Result 34 states and 61 transitions. [2020-07-01 10:34:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:34:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,639 INFO L225 Difference]: With dead ends: 34 [2020-07-01 10:34:26,639 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 10:34:26,640 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 10:34:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 10:34:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 10:34:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 10:34:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-07-01 10:34:26,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 5 [2020-07-01 10:34:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,644 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-07-01 10:34:26,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-07-01 10:34:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 10:34:26,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 10:34:26,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 10:34:26,645 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 125354560, now seen corresponding path program 1 times [2020-07-01 10:34:26,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129878269] [2020-07-01 10:34:26,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,676 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 10:34:26,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129878269] [2020-07-01 10:34:26,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245336005] [2020-07-01 10:34:26,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,679 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 3 states. [2020-07-01 10:34:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,777 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. [2020-07-01 10:34:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 10:34:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,778 INFO L225 Difference]: With dead ends: 30 [2020-07-01 10:34:26,778 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 10:34:26,779 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 10:34:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 10:34:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 10:34:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 10:34:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2020-07-01 10:34:26,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 53 transitions. Word has length 5 [2020-07-01 10:34:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,782 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 53 transitions. [2020-07-01 10:34:26,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 53 transitions. [2020-07-01 10:34:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 10:34:26,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 10:34:26,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 10:34:26,784 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash -408977842, now seen corresponding path program 1 times [2020-07-01 10:34:26,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153773668] [2020-07-01 10:34:26,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,809 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 10:34:26,809 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153773668] [2020-07-01 10:34:26,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875895870] [2020-07-01 10:34:26,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,811 INFO L87 Difference]: Start difference. First operand 26 states and 53 transitions. Second operand 3 states. [2020-07-01 10:34:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:26,902 INFO L93 Difference]: Finished difference Result 26 states and 53 transitions. [2020-07-01 10:34:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:26,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 10:34:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:26,903 INFO L225 Difference]: With dead ends: 26 [2020-07-01 10:34:26,903 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 10:34:26,903 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 10:34:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 10:34:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 10:34:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 10:34:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2020-07-01 10:34:26,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 6 [2020-07-01 10:34:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:26,907 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 47 transitions. [2020-07-01 10:34:26,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 47 transitions. [2020-07-01 10:34:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 10:34:26,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:34:26,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 10:34:26,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 10:34:26,908 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 10:34:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash -408977840, now seen corresponding path program 1 times [2020-07-01 10:34:26,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:26,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703961929] [2020-07-01 10:34:26,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:26,943 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 10:34:26,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703961929] [2020-07-01 10:34:26,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:26,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:26,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103056088] [2020-07-01 10:34:26,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:34:26,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:26,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:26,945 INFO L87 Difference]: Start difference. First operand 23 states and 47 transitions. Second operand 3 states. [2020-07-01 10:34:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:27,037 INFO L93 Difference]: Finished difference Result 23 states and 47 transitions. [2020-07-01 10:34:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:27,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 10:34:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:34:27,038 INFO L225 Difference]: With dead ends: 23 [2020-07-01 10:34:27,038 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 10:34:27,039 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 10:34:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 10:34:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 10:34:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 10:34:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 10:34:27,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 10:34:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:34:27,040 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:34:27,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:34:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 10:34:27,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 10:34:27,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 10:34:27,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 10:34:27,087 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 10:34:27,088 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 10:34:27,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 10:34:27,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:34:27,090 INFO L264 CegarLoopResult]: At program point L29(lines 15 33) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~x0~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x2~0.base)) (= (select |#valid| ULTIMATE.start_main_~x2~0.base) 1) (= 0 ULTIMATE.start_main_~x3~0.offset) (= ULTIMATE.start_main_~x2~0.offset 0) (= ULTIMATE.start_main_~x1~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~x3~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~x1~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x0~0.base)) (= 0 ULTIMATE.start_main_~x0~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~x3~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x1~0.base))) [2020-07-01 10:34:27,090 INFO L268 CegarLoopResult]: For program point L25(lines 25 30) no Hoare annotation was computed. [2020-07-01 10:34:27,090 INFO L268 CegarLoopResult]: For program point L21(lines 21 31) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 32) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-07-01 10:34:27,091 INFO L268 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 10:34:27,092 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 10:34:27,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 10:34:27,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 10:34:27,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:34:27,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 10:34:27,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 10:34:27,096 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 10:34:27,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:34:27 BasicIcfg [2020-07-01 10:34:27,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 10:34:27,118 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 10:34:27,118 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 10:34:27,122 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 10:34:27,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:34:27,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 10:34:23" (1/5) ... [2020-07-01 10:34:27,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c606d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:34:27, skipping insertion in model container [2020-07-01 10:34:27,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:34:27,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:34:24" (2/5) ... [2020-07-01 10:34:27,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c606d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:34:27, skipping insertion in model container [2020-07-01 10:34:27,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:34:27,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:34:24" (3/5) ... [2020-07-01 10:34:27,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c606d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:34:27, skipping insertion in model container [2020-07-01 10:34:27,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:34:27,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:34:24" (4/5) ... [2020-07-01 10:34:27,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c606d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:34:27, skipping insertion in model container [2020-07-01 10:34:27,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:34:27,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:34:27" (5/5) ... [2020-07-01 10:34:27,126 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:34:27,151 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 10:34:27,152 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 10:34:27,152 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:34:27,152 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:34:27,152 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:34:27,152 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 10:34:27,152 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:34:27,152 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 10:34:27,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 10:34:27,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 10:34:27,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:34:27,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:34:27,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 10:34:27,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 10:34:27,168 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 10:34:27,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 10:34:27,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 10:34:27,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:34:27,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:34:27,171 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 10:34:27,171 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 10:34:27,177 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [99] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [189] L-1-->L12: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (and (= v_ULTIMATE.start_main_~x2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x0~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~x3~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1) |v_#valid_3|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~x3~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4)) (= v_ULTIMATE.start_main_~x1~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x0~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~x2~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_1, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_1, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_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~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~x3~0.offset=v_ULTIMATE.start_main_~x3~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_1, ULTIMATE.start_main_~x3~0.base=v_ULTIMATE.start_main_~x3~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~x2~0.offset, ULTIMATE.start_main_~x2~0.base, ULTIMATE.start_main_~x0~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x1~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~x1~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~x3~0.offset, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~x0~0.base, ULTIMATE.start_main_~x3~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 38#L12true [114] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x0~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~x0~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~x0~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~x0~0.base_4) v_ULTIMATE.start_main_~x0~0.offset_4 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~x0~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x0~0.offset_4)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_4, #length=|v_#length_6|, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_4, #length=|v_#length_6|, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 37#L12-1true [111] L12-1-->L13: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~x1~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~x1~0.base_4) v_ULTIMATE.start_main_~x1~0.offset_4 0)) |v_#memory_int_3|) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x1~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x1~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x1~0.offset_4 4) (select |v_#length_8| v_ULTIMATE.start_main_~x1~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_4, #length=|v_#length_8|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_4, #valid=|v_#valid_10|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~x1~0.offset=v_ULTIMATE.start_main_~x1~0.offset_4, #length=|v_#length_8|, ULTIMATE.start_main_~x1~0.base=v_ULTIMATE.start_main_~x1~0.base_4, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#memory_int] 50#L13true [133] L13-->L14: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_main_~x2~0.base_4 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~x2~0.base_4) v_ULTIMATE.start_main_~x2~0.offset_4 0)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_main_~x2~0.offset_4 4) (select |v_#length_10| v_ULTIMATE.start_main_~x2~0.base_4)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x2~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x2~0.offset_4)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_4, #length=|v_#length_10|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_4, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~x2~0.offset=v_ULTIMATE.start_main_~x2~0.offset_4, #length=|v_#length_10|, ULTIMATE.start_main_~x2~0.base=v_ULTIMATE.start_main_~x2~0.base_4, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 15#L14true [91] L14-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~x3~0.offset_4) (<= (+ v_ULTIMATE.start_main_~x3~0.offset_4 4) (select |v_#length_12| v_ULTIMATE.start_main_~x3~0.base_4)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~x3~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~x3~0.base_4) v_ULTIMATE.start_main_~x3~0.offset_4 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_main_~x3~0.base_4))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_main_~x3~0.base=v_ULTIMATE.start_main_~x3~0.base_4, ULTIMATE.start_main_~x3~0.offset=v_ULTIMATE.start_main_~x3~0.offset_4, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_main_~x3~0.base=v_ULTIMATE.start_main_~x3~0.base_4, ULTIMATE.start_main_~x3~0.offset=v_ULTIMATE.start_main_~x3~0.offset_4, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 7#L29true [2020-07-01 10:34:27,178 INFO L796 eck$LassoCheckResult]: Loop: 7#L29true [260] L29-->L17: Formula: (and (= 0 (select (select |v_#memory_int_27| v_ULTIMATE.start_main_~x3~0.base_13) v_ULTIMATE.start_main_~x3~0.offset_10)) (<= 0 v_ULTIMATE.start_main_~x3~0.offset_10) (= 1 (select |v_#valid_47| v_ULTIMATE.start_main_~x3~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x3~0.offset_10 4) (select |v_#length_36| v_ULTIMATE.start_main_~x3~0.base_13))) InVars {ULTIMATE.start_main_~x3~0.offset=v_ULTIMATE.start_main_~x3~0.offset_10, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, #length=|v_#length_36|, ULTIMATE.start_main_~x3~0.base=v_ULTIMATE.start_main_~x3~0.base_13} OutVars{ULTIMATE.start_main_~x3~0.offset=v_ULTIMATE.start_main_~x3~0.offset_10, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, #length=|v_#length_36|, ULTIMATE.start_main_~x3~0.base=v_ULTIMATE.start_main_~x3~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 44#L17true [124] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x0~0.offset_6 4) (select |v_#length_16| v_ULTIMATE.start_main_~x0~0.base_7)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x0~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x0~0.base_7) v_ULTIMATE.start_main_~x0~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x0~0.offset_6)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_7, #length=|v_#length_16|, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_7, #length=|v_#length_16|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 41#L17-1true [119] L17-1-->L18: Formula: (= 0 |v_ULTIMATE.start_main_#t~mem5_4|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 6#L18true [80] L18-->L29: Formula: (and (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x0~0.base_10 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x0~0.base_10) v_ULTIMATE.start_main_~x0~0.offset_8 1)) |v_#memory_int_11|) (<= 0 v_ULTIMATE.start_main_~x0~0.offset_8) (<= (+ v_ULTIMATE.start_main_~x0~0.offset_8 4) (select |v_#length_18| v_ULTIMATE.start_main_~x0~0.base_10)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_main_~x0~0.base_10))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_10, #length=|v_#length_18|, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_8, #valid=|v_#valid_20|} OutVars{#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x0~0.base=v_ULTIMATE.start_main_~x0~0.base_10, #length=|v_#length_18|, ULTIMATE.start_main_~x0~0.offset=v_ULTIMATE.start_main_~x0~0.offset_8, #valid=|v_#valid_20|} AuxVars[] AssignedVars[#memory_int] 7#L29true [2020-07-01 10:34:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash -395125138, now seen corresponding path program 1 times [2020-07-01 10:34:27,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:27,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316731400] [2020-07-01 10:34:27,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:34:27,197 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 10:34:27,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316731400] [2020-07-01 10:34:27,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:34:27,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:34:27,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20868441] [2020-07-01 10:34:27,199 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:34:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:34:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 8792114, now seen corresponding path program 1 times [2020-07-01 10:34:27,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:34:27,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334568661] [2020-07-01 10:34:27,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:34:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:34:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:34:27,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:34:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:34:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:34:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:34:27,287 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 10:34:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:34:27,401 INFO L93 Difference]: Finished difference Result 50 states and 86 transitions. [2020-07-01 10:34:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:34:27,404 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 10:34:27,408 INFO L168 Benchmark]: Toolchain (without parser) took 3608.07 ms. Allocated memory was 514.9 MB in the beginning and 585.6 MB in the end (delta: 70.8 MB). Free memory was 438.4 MB in the beginning and 473.8 MB in the end (delta: -35.4 MB). Peak memory consumption was 35.3 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,409 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 10:34:27,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.45 ms. Allocated memory was 514.9 MB in the beginning and 547.4 MB in the end (delta: 32.5 MB). Free memory was 437.8 MB in the beginning and 514.2 MB in the end (delta: -76.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 547.4 MB. Free memory was 514.2 MB in the beginning and 512.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,411 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 547.4 MB. Free memory was 512.4 MB in the beginning and 510.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,411 INFO L168 Benchmark]: RCFGBuilder took 390.95 ms. Allocated memory is still 547.4 MB. Free memory was 510.2 MB in the beginning and 484.3 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,412 INFO L168 Benchmark]: BlockEncodingV2 took 130.64 ms. Allocated memory is still 547.4 MB. Free memory was 484.3 MB in the beginning and 470.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,412 INFO L168 Benchmark]: TraceAbstraction took 2420.77 ms. Allocated memory was 547.4 MB in the beginning and 585.6 MB in the end (delta: 38.3 MB). Free memory was 469.7 MB in the beginning and 513.5 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 10:34:27,413 INFO L168 Benchmark]: BuchiAutomizer took 287.81 ms. Allocated memory is still 585.6 MB. Free memory was 513.5 MB in the beginning and 473.8 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 50.3 GB. [2020-07-01 10:34:27,416 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 55 locations, 59 edges - StatisticsResult: Encoded RCFG 50 locations, 101 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.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.45 ms. Allocated memory was 514.9 MB in the beginning and 547.4 MB in the end (delta: 32.5 MB). Free memory was 437.8 MB in the beginning and 514.2 MB in the end (delta: -76.3 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 547.4 MB. Free memory was 514.2 MB in the beginning and 512.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 547.4 MB. Free memory was 512.4 MB in the beginning and 510.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 390.95 ms. Allocated memory is still 547.4 MB. Free memory was 510.2 MB in the beginning and 484.3 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.64 ms. Allocated memory is still 547.4 MB. Free memory was 484.3 MB in the beginning and 470.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2420.77 ms. Allocated memory was 547.4 MB in the beginning and 585.6 MB in the end (delta: 38.3 MB). Free memory was 469.7 MB in the beginning and 513.5 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 287.81 ms. Allocated memory is still 585.6 MB. Free memory was 513.5 MB in the beginning and 473.8 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 10:34:27,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:34:27,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((1 == \valid[x0] && 4 == unknown-#length-unknown[x2]) && \valid[x2] == 1) && 0 == x3) && x2 == 0) && x1 == 0) && 1 == \valid[x3]) && 1 == \valid[x1]) && 4 == unknown-#length-unknown[x0]) && 0 == x0) && 4 == unknown-#length-unknown[x3]) && 4 == unknown-#length-unknown[x1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 77 SDtfs, 551 SDslu, 7 SDs, 0 SdLazy, 680 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 10:34:20.550 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_zt5kht/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 10:34:27.653 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check