/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:45:21,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:45:21,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:45:21,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:45:21,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:45:21,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:45:21,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:45:21,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:45:21,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:45:21,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:45:21,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:45:21,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:45:21,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:45:21,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:45:21,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:45:21,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:45:21,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:45:21,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:45:21,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:45:21,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:45:21,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:45:21,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:45:21,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:45:21,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:45:21,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:45:21,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:45:21,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:45:21,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:45:21,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:45:21,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:45:21,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:45:21,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:45:21,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:45:21,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:45:21,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:45:21,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:45:21,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:45:21,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:45:21,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:45:21,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:45:21,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:45:21,814 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:45:21,828 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:45:21,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:45:21,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:45:21,830 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:45:21,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:45:21,830 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:45:21,830 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:45:21,831 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:45:21,831 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:45:21,831 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:45:21,831 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:45:21,831 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:45:21,832 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:45:21,832 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:45:21,832 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:45:21,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:45:21,832 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:45:21,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:45:21,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:45:21,833 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:45:21,833 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:45:21,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:45:21,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:45:21,833 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:45:21,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:45:21,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:45:21,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:45:21,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:45:21,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:45:21,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:45:22,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:45:22,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:45:22,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:45:22,017 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:45:22,018 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:45:22,082 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_fFCGru/tmp/1b25ac7e59dd4ef7a9cd1de6f9165138/FLAG0e861151e [2020-07-01 12:45:22,416 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:45:22,416 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:45:22,417 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:45:22,423 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_fFCGru/tmp/1b25ac7e59dd4ef7a9cd1de6f9165138/FLAG0e861151e [2020-07-01 12:45:22,815 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_fFCGru/tmp/1b25ac7e59dd4ef7a9cd1de6f9165138 [2020-07-01 12:45:22,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:45:22,828 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:45:22,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:45:22,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:45:22,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:45:22,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:45:22" (1/1) ... [2020-07-01 12:45:22,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da64a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:22, skipping insertion in model container [2020-07-01 12:45:22,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:45:22" (1/1) ... [2020-07-01 12:45:22,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:45:22,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:45:23,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:45:23,107 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:45:23,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:45:23,140 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:45:23,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23 WrapperNode [2020-07-01 12:45:23,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:45:23,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:45:23,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:45:23,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:45:23,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:45:23,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:45:23,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:45:23,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:45:23,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:45:23,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:45:23,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:45:23,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:45:23,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:45:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:45:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:45:23,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:45:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:45:23,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:45:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:45:23,584 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:45:23,584 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-01 12:45:23,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:45:23 BoogieIcfgContainer [2020-07-01 12:45:23,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:45:23,589 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:45:23,589 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:45:23,591 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:45:23,592 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:45:23" (1/1) ... [2020-07-01 12:45:23,608 INFO L313 BlockEncoder]: Initial Icfg 55 locations, 58 edges [2020-07-01 12:45:23,609 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:45:23,610 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:45:23,611 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:45:23,611 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:45:23,613 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:45:23,614 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:45:23,614 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:45:23,643 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:45:23,678 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:45:23,683 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:45:23,685 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:45:23,724 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:45:23,726 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:45:23,728 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:45:23,728 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:45:23,729 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:45:23,729 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:45:23,730 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 82 edges [2020-07-01 12:45:23,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:45:23 BasicIcfg [2020-07-01 12:45:23,730 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:45:23,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:45:23,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:45:23,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:45:23,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:45:22" (1/4) ... [2020-07-01 12:45:23,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bd1e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:45:23, skipping insertion in model container [2020-07-01 12:45:23,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (2/4) ... [2020-07-01 12:45:23,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bd1e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:45:23, skipping insertion in model container [2020-07-01 12:45:23,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:45:23" (3/4) ... [2020-07-01 12:45:23,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bd1e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:45:23, skipping insertion in model container [2020-07-01 12:45:23,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:45:23" (4/4) ... [2020-07-01 12:45:23,739 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:45:23,749 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:45:23,757 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:45:23,771 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:45:23,794 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:45:23,794 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:45:23,795 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:45:23,795 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:45:23,795 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:45:23,795 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:45:23,795 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:45:23,795 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:45:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 12:45:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:45:23,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:23,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:45:23,818 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 124486, now seen corresponding path program 1 times [2020-07-01 12:45:23,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:23,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446707339] [2020-07-01 12:45:23,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:23,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446707339] [2020-07-01 12:45:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:23,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:23,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271072427] [2020-07-01 12:45:23,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,017 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:45:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,181 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2020-07-01 12:45:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:45:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,195 INFO L225 Difference]: With dead ends: 90 [2020-07-01 12:45:24,195 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:45:24,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 12:45:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:45:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:45:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:45:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2020-07-01 12:45:24,239 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 3 [2020-07-01 12:45:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,239 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2020-07-01 12:45:24,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2020-07-01 12:45:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:45:24,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:45:24,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:45:24,242 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 124579, now seen corresponding path program 1 times [2020-07-01 12:45:24,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229450775] [2020-07-01 12:45:24,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:24,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229450775] [2020-07-01 12:45:24,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:24,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:24,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385616892] [2020-07-01 12:45:24,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,284 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 3 states. [2020-07-01 12:45:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,379 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2020-07-01 12:45:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:45:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,381 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:45:24,381 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:45:24,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:45:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 12:45:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:45:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 71 transitions. [2020-07-01 12:45:24,388 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 71 transitions. Word has length 3 [2020-07-01 12:45:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,390 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 71 transitions. [2020-07-01 12:45:24,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 71 transitions. [2020-07-01 12:45:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:45:24,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:45:24,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:45:24,391 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash 124580, now seen corresponding path program 1 times [2020-07-01 12:45:24,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867074738] [2020-07-01 12:45:24,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:24,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867074738] [2020-07-01 12:45:24,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:24,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:24,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977191440] [2020-07-01 12:45:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,430 INFO L87 Difference]: Start difference. First operand 46 states and 71 transitions. Second operand 3 states. [2020-07-01 12:45:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,557 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2020-07-01 12:45:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:45:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,559 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:45:24,559 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:45:24,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:45:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:45:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:45:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2020-07-01 12:45:24,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 3 [2020-07-01 12:45:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,565 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2020-07-01 12:45:24,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2020-07-01 12:45:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:45:24,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:45:24,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:45:24,567 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash 124577, now seen corresponding path program 1 times [2020-07-01 12:45:24,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697394879] [2020-07-01 12:45:24,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:24,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697394879] [2020-07-01 12:45:24,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:24,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:24,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118787162] [2020-07-01 12:45:24,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,602 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2020-07-01 12:45:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,728 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2020-07-01 12:45:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:45:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,729 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:45:24,729 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:45:24,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:45:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:45:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:45:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2020-07-01 12:45:24,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 3 [2020-07-01 12:45:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,735 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2020-07-01 12:45:24,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2020-07-01 12:45:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:45:24,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:45:24,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:45:24,736 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,736 INFO L82 PathProgramCache]: Analyzing trace with hash 3859368, now seen corresponding path program 1 times [2020-07-01 12:45:24,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797428762] [2020-07-01 12:45:24,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:24,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797428762] [2020-07-01 12:45:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:24,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280118917] [2020-07-01 12:45:24,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,784 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand 3 states. [2020-07-01 12:45:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,875 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2020-07-01 12:45:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:45:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,876 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:45:24,876 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:45:24,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:45:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:45:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:45:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2020-07-01 12:45:24,881 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 4 [2020-07-01 12:45:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,882 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2020-07-01 12:45:24,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2020-07-01 12:45:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:45:24,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:45:24,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:45:24,883 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 3859370, now seen corresponding path program 1 times [2020-07-01 12:45:24,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112791473] [2020-07-01 12:45:24,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:24,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112791473] [2020-07-01 12:45:24,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:24,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:24,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724957196] [2020-07-01 12:45:24,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:24,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,921 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 3 states. [2020-07-01 12:45:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:24,991 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2020-07-01 12:45:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:24,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:45:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:24,992 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:45:24,992 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:45:24,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:45:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:45:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:45:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-07-01 12:45:24,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 4 [2020-07-01 12:45:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:24,997 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-07-01 12:45:24,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-07-01 12:45:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:45:24,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:24,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:45:24,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:45:24,998 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash -992372319, now seen corresponding path program 1 times [2020-07-01 12:45:24,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:24,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063710392] [2020-07-01 12:45:24,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:25,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063710392] [2020-07-01 12:45:25,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:25,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:25,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629563348] [2020-07-01 12:45:25,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:25,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:25,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:25,048 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 3 states. [2020-07-01 12:45:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:25,114 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2020-07-01 12:45:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:25,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:45:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:25,116 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:45:25,116 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:45:25,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:45:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:45:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:45:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-07-01 12:45:25,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 7 [2020-07-01 12:45:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:25,120 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-01 12:45:25,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-01 12:45:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:45:25,121 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:45:25,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:45:25,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:45:25,121 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:45:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash -992372321, now seen corresponding path program 1 times [2020-07-01 12:45:25,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:25,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324516091] [2020-07-01 12:45:25,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:25,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324516091] [2020-07-01 12:45:25,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:25,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:25,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839328448] [2020-07-01 12:45:25,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:45:25,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:25,162 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 3 states. [2020-07-01 12:45:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:25,202 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-01 12:45:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:25,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:45:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:45:25,203 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:45:25,203 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:45:25,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:45:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:45:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:45:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:45:25,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 12:45:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:45:25,204 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:45:25,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:45:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:45:25,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:45:25,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:45:25,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:45:25,262 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,263 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,264 INFO L268 CegarLoopResult]: For program point L9-1(lines 9 14) no Hoare annotation was computed. [2020-07-01 12:45:25,265 INFO L268 CegarLoopResult]: For program point L9-3(lines 9 14) no Hoare annotation was computed. [2020-07-01 12:45:25,265 INFO L268 CegarLoopResult]: For program point L9-5(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,265 INFO L264 CegarLoopResult]: At program point L9-7(lines 9 14) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base))) [2020-07-01 12:45:25,265 INFO L268 CegarLoopResult]: For program point L9-8(lines 9 14) no Hoare annotation was computed. [2020-07-01 12:45:25,265 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:45:25,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,266 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 13) no Hoare annotation was computed. [2020-07-01 12:45:25,267 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:45:25,268 INFO L268 CegarLoopResult]: For program point L10-4(lines 10 13) no Hoare annotation was computed. [2020-07-01 12:45:25,268 INFO L268 CegarLoopResult]: For program point L10-5(line 10) no Hoare annotation was computed. [2020-07-01 12:45:25,268 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:45:25,268 INFO L264 CegarLoopResult]: At program point L10-7(lines 10 13) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~j~0.offset) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base))) [2020-07-01 12:45:25,271 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:45:25,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,290 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:45:25 BasicIcfg [2020-07-01 12:45:25,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:45:25,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:45:25,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:45:25,298 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:45:25,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:45:25,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:45:22" (1/5) ... [2020-07-01 12:45:25,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6aa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:45:25, skipping insertion in model container [2020-07-01 12:45:25,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:45:25,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:45:23" (2/5) ... [2020-07-01 12:45:25,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6aa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:45:25, skipping insertion in model container [2020-07-01 12:45:25,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:45:25,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:45:23" (3/5) ... [2020-07-01 12:45:25,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6aa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:45:25, skipping insertion in model container [2020-07-01 12:45:25,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:45:25,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:45:23" (4/5) ... [2020-07-01 12:45:25,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6aa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:45:25, skipping insertion in model container [2020-07-01 12:45:25,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:45:25,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:45:25" (5/5) ... [2020-07-01 12:45:25,303 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:45:25,323 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:45:25,324 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:45:25,324 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:45:25,324 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:45:25,324 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:45:25,324 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:45:25,324 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:45:25,324 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:45:25,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:45:25,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 12:45:25,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:45:25,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:45:25,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:45:25,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:45:25,340 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:45:25,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 12:45:25,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-01 12:45:25,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:45:25,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:45:25,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:45:25,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:45:25,348 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue [93] 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] 15#L-1true [173] L-1-->L8: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~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_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~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~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 36#L8true [87] L8-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_5| v_ULTIMATE.start_main_~c~0.base_4)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_main_~c~0.base_4)) (= (store |v_#memory_int_2| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0)) |v_#memory_int_1|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int] 34#L8-1true [84] L8-1-->L9-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_7| v_ULTIMATE.start_main_~i~0.base_4)) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0)) |v_#memory_int_3|) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~i~0.base_4)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_7|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#memory_int] 24#L9-7true [2020-07-01 12:45:25,349 INFO L796 eck$LassoCheckResult]: Loop: 24#L9-7true [114] L9-7-->L9-1: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem5_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 11#L9-1true [103] L9-1-->L10: Formula: (< |v_ULTIMATE.start_main_#t~mem5_6| 10) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 17#L10true [79] L10-->L10-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_11| v_ULTIMATE.start_main_~j~0.base_4)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_main_~j~0.base_4)) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 3))) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 46#L10-7true [130] L10-7-->L10-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_6) (<= (+ v_ULTIMATE.start_main_~j~0.offset_6 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~j~0.base_7) v_ULTIMATE.start_main_~j~0.offset_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_6, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_7, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 37#L10-2true [149] L10-2-->L9-3: Formula: (>= |v_ULTIMATE.start_main_#t~mem7_4| 12) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_4|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 7#L9-3true [233] L9-3-->L9-5: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_36| v_ULTIMATE.start_main_~i~0.base_16)) (= 1 (select |v_#valid_45| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_25| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_25|, #length=|v_#length_36|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 28#L9-5true [235] L9-5-->L9-7: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_main_~i~0.base_17)) (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_47| v_ULTIMATE.start_main_~i~0.base_17)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_29|, #length=|v_#length_38|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem3, ULTIMATE.start_main_#t~post4] 24#L9-7true [2020-07-01 12:45:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 3863118, now seen corresponding path program 1 times [2020-07-01 12:45:25,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:25,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974944019] [2020-07-01 12:45:25,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:25,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974944019] [2020-07-01 12:45:25,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:25,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:45:25,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852899117] [2020-07-01 12:45:25,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:45:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:45:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1430168242, now seen corresponding path program 1 times [2020-07-01 12:45:25,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:45:25,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458924242] [2020-07-01 12:45:25,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:45:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:45:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:45:25,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458924242] [2020-07-01 12:45:25,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:45:25,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:45:25,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373758164] [2020-07-01 12:45:25,391 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:45:25,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:45:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:45:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:45:25,393 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 12:45:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:45:25,475 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 12:45:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:45:25,477 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:45:25,482 INFO L168 Benchmark]: Toolchain (without parser) took 2652.96 ms. Allocated memory was 514.9 MB in the beginning and 601.4 MB in the end (delta: 86.5 MB). Free memory was 438.9 MB in the beginning and 444.1 MB in the end (delta: -5.2 MB). Peak memory consumption was 81.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,482 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:45:25,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.32 ms. Allocated memory was 514.9 MB in the beginning and 572.0 MB in the end (delta: 57.1 MB). Free memory was 438.3 MB in the beginning and 539.4 MB in the end (delta: -101.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 572.0 MB. Free memory was 539.4 MB in the beginning and 537.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,484 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 572.0 MB. Free memory was 537.3 MB in the beginning and 536.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,484 INFO L168 Benchmark]: RCFGBuilder took 381.56 ms. Allocated memory is still 572.0 MB. Free memory was 535.3 MB in the beginning and 511.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,485 INFO L168 Benchmark]: BlockEncodingV2 took 141.32 ms. Allocated memory is still 572.0 MB. Free memory was 511.1 MB in the beginning and 499.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,485 INFO L168 Benchmark]: TraceAbstraction took 1562.90 ms. Allocated memory was 572.0 MB in the beginning and 601.4 MB in the end (delta: 29.4 MB). Free memory was 498.9 MB in the beginning and 472.3 MB in the end (delta: 26.6 MB). Peak memory consumption was 55.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,486 INFO L168 Benchmark]: BuchiAutomizer took 184.21 ms. Allocated memory is still 601.4 MB. Free memory was 472.3 MB in the beginning and 444.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:45:25,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 55 locations, 58 edges - StatisticsResult: Encoded RCFG 46 locations, 82 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 312.32 ms. Allocated memory was 514.9 MB in the beginning and 572.0 MB in the end (delta: 57.1 MB). Free memory was 438.3 MB in the beginning and 539.4 MB in the end (delta: -101.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 572.0 MB. Free memory was 539.4 MB in the beginning and 537.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.42 ms. Allocated memory is still 572.0 MB. Free memory was 537.3 MB in the beginning and 536.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 381.56 ms. Allocated memory is still 572.0 MB. Free memory was 535.3 MB in the beginning and 511.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.32 ms. Allocated memory is still 572.0 MB. Free memory was 511.1 MB in the beginning and 499.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1562.90 ms. Allocated memory was 572.0 MB in the beginning and 601.4 MB in the end (delta: 29.4 MB). Free memory was 498.9 MB in the beginning and 472.3 MB in the end (delta: 26.6 MB). Peak memory consumption was 55.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 184.21 ms. Allocated memory is still 601.4 MB. Free memory was 472.3 MB in the beginning and 444.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: 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: 11]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:45:25,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 1 == \valid[c] - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 12:45:25,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:45:25,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:45:25,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((1 == \valid[j] && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && 0 == i) && 4 == unknown-#length-unknown[c]) && unknown-#length-unknown[j] == 4) && 0 == j) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 387 SDslu, 4 SDs, 0 SdLazy, 368 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:45:19.584 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_fFCGru/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:45:25.729 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check