/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:08:21,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:08:21,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:08:21,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:08:21,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:08:21,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:08:21,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:08:21,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:08:21,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:08:21,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:08:21,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:08:21,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:08:21,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:08:21,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:08:21,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:08:21,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:08:21,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:08:21,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:08:21,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:08:21,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:08:21,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:08:21,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:08:21,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:08:21,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:08:21,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:08:21,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:08:21,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:08:21,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:08:21,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:08:21,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:08:21,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:08:21,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:08:21,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:08:21,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:08:21,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:08:21,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:08:21,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:08:21,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:08:21,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:08:21,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:08:21,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:08:21,858 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:08:21,873 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:08:21,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:08:21,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:08:21,875 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:08:21,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:08:21,875 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:08:21,875 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:08:21,875 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:08:21,876 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:08:21,877 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:08:21,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:08:21,877 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:08:21,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:08:21,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:08:21,877 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:08:21,878 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:08:21,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:08:21,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:08:21,878 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:08:21,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:08:21,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:08:21,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:08:21,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:08:21,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:08:22,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:08:22,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:08:22,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:08:22,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:08:22,070 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:08:22,071 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:08:22,143 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6ECA1q/tmp/f12a965204b547e099cdb0fb257f0c7a/FLAG4108eeeb6 [2020-07-01 13:08:22,477 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:08:22,478 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:08:22,478 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:08:22,485 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_6ECA1q/tmp/f12a965204b547e099cdb0fb257f0c7a/FLAG4108eeeb6 [2020-07-01 13:08:22,893 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_6ECA1q/tmp/f12a965204b547e099cdb0fb257f0c7a [2020-07-01 13:08:22,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:08:22,906 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:08:22,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:08:22,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:08:22,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:08:22,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:08:22" (1/1) ... [2020-07-01 13:08:22,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb9f374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:22, skipping insertion in model container [2020-07-01 13:08:22,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:08:22" (1/1) ... [2020-07-01 13:08:22,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:08:22,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:08:23,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:08:23,196 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:08:23,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:08:23,229 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:08:23,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23 WrapperNode [2020-07-01 13:08:23,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:08:23,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:08:23,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:08:23,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:08:23,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:08:23,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:08:23,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:08:23,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:08:23,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:08:23,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:08:23,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:08:23,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:08:23,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08: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 13:08:23,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:08:23,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:08:23,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:08:23,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:08:23,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:08:23,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:08:23,680 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:08:23,680 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:08:23,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:23 BoogieIcfgContainer [2020-07-01 13:08:23,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:08:23,685 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:08:23,685 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:08:23,687 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:08:23,688 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,704 INFO L313 BlockEncoder]: Initial Icfg 55 locations, 58 edges [2020-07-01 13:08:23,706 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:08:23,706 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:08:23,707 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:08:23,707 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:08:23,709 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:08:23,710 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:08:23,711 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:08:23,739 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:08:23,775 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 13:08:23,780 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:08:23,782 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:08:23,830 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:08:23,833 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:08:23,835 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:08:23,835 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:08:23,836 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:08:23,836 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:08:23,837 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 82 edges [2020-07-01 13:08:23,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:23 BasicIcfg [2020-07-01 13:08:23,838 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:08:23,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:08:23,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:08:23,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:08:23,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:08:22" (1/4) ... [2020-07-01 13:08:23,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e292743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:08:23, skipping insertion in model container [2020-07-01 13:08:23,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (2/4) ... [2020-07-01 13:08:23,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e292743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:08:23, skipping insertion in model container [2020-07-01 13:08:23,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:23" (3/4) ... [2020-07-01 13:08:23,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e292743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:23, skipping insertion in model container [2020-07-01 13:08:23,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:23" (4/4) ... [2020-07-01 13:08:23,846 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:08:23,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:08:23,865 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 13:08:23,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 13:08:23,904 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:08:23,904 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:08:23,904 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:08:23,904 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:08:23,904 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:08:23,905 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:08:23,905 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:08:23,905 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:08:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 13:08:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:23,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:23,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:23,928 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 139924, now seen corresponding path program 1 times [2020-07-01 13:08:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:23,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943546689] [2020-07-01 13:08:23,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943546689] [2020-07-01 13:08:24,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947172759] [2020-07-01 13:08:24,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,125 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 13:08:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:24,283 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2020-07-01 13:08:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:24,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:24,298 INFO L225 Difference]: With dead ends: 90 [2020-07-01 13:08:24,298 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 13:08:24,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 13:08:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 13:08:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 13:08:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2020-07-01 13:08:24,342 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 3 [2020-07-01 13:08:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:24,342 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2020-07-01 13:08:24,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2020-07-01 13:08:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:24,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:24,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:08:24,345 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 140048, now seen corresponding path program 1 times [2020-07-01 13:08:24,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416214427] [2020-07-01 13:08:24,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416214427] [2020-07-01 13:08:24,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272679386] [2020-07-01 13:08:24,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,408 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 3 states. [2020-07-01 13:08:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:24,527 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 13:08:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:24,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:24,529 INFO L225 Difference]: With dead ends: 46 [2020-07-01 13:08:24,529 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 13:08:24,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 13:08:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 13:08:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 13:08:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2020-07-01 13:08:24,536 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 3 [2020-07-01 13:08:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:24,536 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2020-07-01 13:08:24,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2020-07-01 13:08:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:24,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:24,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:08:24,537 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash 140050, now seen corresponding path program 1 times [2020-07-01 13:08:24,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781734648] [2020-07-01 13:08:24,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781734648] [2020-07-01 13:08:24,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114142457] [2020-07-01 13:08:24,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,567 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand 3 states. [2020-07-01 13:08:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:24,650 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2020-07-01 13:08:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:24,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:24,651 INFO L225 Difference]: With dead ends: 46 [2020-07-01 13:08:24,651 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 13:08:24,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 13:08:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 13:08:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 13:08:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2020-07-01 13:08:24,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 3 [2020-07-01 13:08:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:24,657 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2020-07-01 13:08:24,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2020-07-01 13:08:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:24,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:24,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:08:24,659 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 140051, now seen corresponding path program 1 times [2020-07-01 13:08:24,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724776454] [2020-07-01 13:08:24,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724776454] [2020-07-01 13:08:24,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961475360] [2020-07-01 13:08:24,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,699 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand 3 states. [2020-07-01 13:08:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:24,811 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2020-07-01 13:08:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:24,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:24,812 INFO L225 Difference]: With dead ends: 42 [2020-07-01 13:08:24,813 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:08:24,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:08:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 13:08:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 13:08:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2020-07-01 13:08:24,818 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 3 [2020-07-01 13:08:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:24,818 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2020-07-01 13:08:24,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2020-07-01 13:08:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:08:24,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:08:24,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:08:24,819 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash 4338816, now seen corresponding path program 1 times [2020-07-01 13:08:24,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825524749] [2020-07-01 13:08:24,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825524749] [2020-07-01 13:08:24,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421832127] [2020-07-01 13:08:24,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,857 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand 3 states. [2020-07-01 13:08:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:24,959 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2020-07-01 13:08:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:24,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:08:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:24,961 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:08:24,961 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:08:24,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:08:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:08:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:08:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2020-07-01 13:08:24,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 51 transitions. Word has length 4 [2020-07-01 13:08:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:24,966 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 51 transitions. [2020-07-01 13:08:24,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 51 transitions. [2020-07-01 13:08:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:08:24,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:08:24,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:08:24,968 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash 4338818, now seen corresponding path program 1 times [2020-07-01 13:08:24,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725258281] [2020-07-01 13:08:24,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725258281] [2020-07-01 13:08:25,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766306525] [2020-07-01 13:08:25,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:25,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,014 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. Second operand 3 states. [2020-07-01 13:08:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,082 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. [2020-07-01 13:08:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:08:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:25,083 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:08:25,083 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:08:25,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:08:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:08:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:08:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-01 13:08:25,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 4 [2020-07-01 13:08:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:25,088 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-01 13:08:25,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2020-07-01 13:08:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:08:25,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:25,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:25,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:08:25,089 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash 134501744, now seen corresponding path program 1 times [2020-07-01 13:08:25,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129177601] [2020-07-01 13:08:25,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129177601] [2020-07-01 13:08:25,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118345725] [2020-07-01 13:08:25,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:25,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,126 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 3 states. [2020-07-01 13:08:25,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,189 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-07-01 13:08:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:08:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:25,190 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:08:25,190 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 13:08:25,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 13:08:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 13:08:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 13:08:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-07-01 13:08:25,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 5 [2020-07-01 13:08:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:25,194 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-07-01 13:08:25,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-01 13:08:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:08:25,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:25,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:25,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:08:25,195 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:08:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash 134501746, now seen corresponding path program 1 times [2020-07-01 13:08:25,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466886483] [2020-07-01 13:08:25,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466886483] [2020-07-01 13:08:25,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137158932] [2020-07-01 13:08:25,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:25,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,232 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 3 states. [2020-07-01 13:08:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,275 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-01 13:08:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:08:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:25,276 INFO L225 Difference]: With dead ends: 24 [2020-07-01 13:08:25,276 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:08:25,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:08:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:08:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:08:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:08:25,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:08:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:25,278 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:08:25,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:08:25,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:08:25,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:08:25,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:08:25,349 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,349 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,349 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,349 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:25,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:25,352 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:08:25,352 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:25,352 INFO L268 CegarLoopResult]: For program point L13(lines 13 20) no Hoare annotation was computed. [2020-07-01 13:08:25,352 INFO L264 CegarLoopResult]: At program point L13-2(lines 12 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point L13-3(lines 13 20) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,353 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:08:25,354 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 17) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:08:25,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point L14-4(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:25,355 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:08:25,358 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:08:25,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:25 BasicIcfg [2020-07-01 13:08:25,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:08:25,382 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:08:25,382 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:08:25,385 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:08:25,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:25,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:08:22" (1/5) ... [2020-07-01 13:08:25,387 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@416e8840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:25, skipping insertion in model container [2020-07-01 13:08:25,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:25,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (2/5) ... [2020-07-01 13:08:25,387 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@416e8840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:25, skipping insertion in model container [2020-07-01 13:08:25,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:25,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:23" (3/5) ... [2020-07-01 13:08:25,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@416e8840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:25, skipping insertion in model container [2020-07-01 13:08:25,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:25,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:23" (4/5) ... [2020-07-01 13:08:25,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@416e8840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:25, skipping insertion in model container [2020-07-01 13:08:25,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:25,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:25" (5/5) ... [2020-07-01 13:08:25,390 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:08:25,410 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:08:25,411 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:08:25,411 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:08:25,411 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:08:25,411 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:08:25,411 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:08:25,411 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:08:25,411 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:08:25,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 13:08:25,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:08:25,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:25,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:25,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:25,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:25,427 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:08:25,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 13:08:25,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:08:25,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:25,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:25,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:25,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:25,435 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue [109] 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] 16#L-1true [175] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 18#L10true [84] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 36#L10-1true [124] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 41#L11true [110] L11-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 42#L13-2true [2020-07-01 13:08:25,436 INFO L796 eck$LassoCheckResult]: Loop: 42#L13-2true [132] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L13true [136] L13-->L14-3: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 21#L14-3true [92] L14-3-->L14-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 24#L14-1true [153] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem4_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 19#L14-4true [87] L14-4-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_23|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 12#L18true [236] L18-->L19: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_46| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#valid=|v_#valid_46|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_46|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 35#L19true [106] L19-->L19-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~c~0.base_12) v_ULTIMATE.start_test_fun_~c~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_9 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_9)) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_9, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_12, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 33#L19-1true [239] L19-1-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_20 4) (select |v_#length_40| v_ULTIMATE.start_test_fun_~c~0.base_26)) (= |v_#memory_int_32| (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_26 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_26) v_ULTIMATE.start_test_fun_~c~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_20) (= 1 (select |v_#valid_50| v_ULTIMATE.start_test_fun_~c~0.base_26))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_20, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_33|, #length=|v_#length_40|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_26} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_20, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_32|, #length=|v_#length_40|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 42#L13-2true [2020-07-01 13:08:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 134591043, now seen corresponding path program 1 times [2020-07-01 13:08:25,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858474485] [2020-07-01 13:08:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858474485] [2020-07-01 13:08:25,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254409817] [2020-07-01 13:08:25,458 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:08:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash -465305156, now seen corresponding path program 1 times [2020-07-01 13:08:25,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27243996] [2020-07-01 13:08:25,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:08:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:08:25,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:08:25,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,605 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 13:08:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,690 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 13:08:25,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,692 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:08:25,697 INFO L168 Benchmark]: Toolchain (without parser) took 2790.25 ms. Allocated memory was 514.9 MB in the beginning and 575.7 MB in the end (delta: 60.8 MB). Free memory was 438.7 MB in the beginning and 400.4 MB in the end (delta: 38.4 MB). Peak memory consumption was 99.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,697 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:08:25,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.32 ms. Allocated memory was 514.9 MB in the beginning and 547.9 MB in the end (delta: 33.0 MB). Free memory was 438.2 MB in the beginning and 514.3 MB in the end (delta: -76.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 547.9 MB. Free memory was 514.3 MB in the beginning and 512.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,699 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 547.9 MB. Free memory was 512.0 MB in the beginning and 510.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,700 INFO L168 Benchmark]: RCFGBuilder took 387.48 ms. Allocated memory is still 547.9 MB. Free memory was 510.4 MB in the beginning and 485.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,700 INFO L168 Benchmark]: BlockEncodingV2 took 152.58 ms. Allocated memory is still 547.9 MB. Free memory was 485.0 MB in the beginning and 472.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,701 INFO L168 Benchmark]: TraceAbstraction took 1542.59 ms. Allocated memory was 547.9 MB in the beginning and 575.7 MB in the end (delta: 27.8 MB). Free memory was 472.1 MB in the beginning and 443.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 56.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,701 INFO L168 Benchmark]: BuchiAutomizer took 312.56 ms. Allocated memory is still 575.7 MB. Free memory was 443.4 MB in the beginning and 400.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:25,705 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.18 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 323.32 ms. Allocated memory was 514.9 MB in the beginning and 547.9 MB in the end (delta: 33.0 MB). Free memory was 438.2 MB in the beginning and 514.3 MB in the end (delta: -76.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 547.9 MB. Free memory was 514.3 MB in the beginning and 512.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 547.9 MB. Free memory was 512.0 MB in the beginning and 510.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 387.48 ms. Allocated memory is still 547.9 MB. Free memory was 510.4 MB in the beginning and 485.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 152.58 ms. Allocated memory is still 547.9 MB. Free memory was 485.0 MB in the beginning and 472.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1542.59 ms. Allocated memory was 547.9 MB in the beginning and 575.7 MB in the end (delta: 27.8 MB). Free memory was 472.1 MB in the beginning and 443.4 MB in the end (delta: 28.7 MB). Peak memory consumption was 56.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 312.56 ms. Allocated memory is still 575.7 MB. Free memory was 443.4 MB in the beginning and 400.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 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 #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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: 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: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: 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: 12]: Loop Invariant [2020-07-01 13:08:25,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:08:25,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:25,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:25,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 SDtfs, 387 SDslu, 4 SDs, 0 SdLazy, 365 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, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:08:19.633 ----------------------------------------------- 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_6ECA1q/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:08:25.946 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check