/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:36:22,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:36:22,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:36:22,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:36:22,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:36:22,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:36:22,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:36:22,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:36:22,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:36:22,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:36:22,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:36:22,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:36:22,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:36:22,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:36:22,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:36:22,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:36:22,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:36:22,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:36:22,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:36:22,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:36:22,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:36:22,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:36:22,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:36:22,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:36:22,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:36:22,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:36:22,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:36:22,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:36:22,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:36:22,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:36:22,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:36:22,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:36:22,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:36:22,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:36:22,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:36:22,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:36:22,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:36:22,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:36:22,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:36:22,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:36:22,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:36:22,076 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:36:22,090 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:36:22,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:36:22,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:36:22,092 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:36:22,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:36:22,092 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:22,092 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:36:22,092 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:36:22,093 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:36:22,094 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:36:22,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:36:22,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:36:22,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:36:22,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:36:22,095 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:36:22,095 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:36:22,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:36:22,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:36:22,095 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:36:22,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:36:22,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:36:22,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:36:22,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:36:22,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:36:22,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:36:22,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:36:22,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:36:22,278 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:36:22,279 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:36:22,279 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:36:22,345 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_SZGOtD/tmp/6431cee0c1544b6d8c3a5413a75577b8/FLAG4b0f2d159 [2020-07-01 12:36:22,679 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:36:22,679 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:36:22,680 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:36:22,686 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_SZGOtD/tmp/6431cee0c1544b6d8c3a5413a75577b8/FLAG4b0f2d159 [2020-07-01 12:36:23,084 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_SZGOtD/tmp/6431cee0c1544b6d8c3a5413a75577b8 [2020-07-01 12:36:23,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:36:23,096 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:36:23,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:23,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:36:23,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:36:23,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709e6ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23, skipping insertion in model container [2020-07-01 12:36:23,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:36:23,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:36:23,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:23,380 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:36:23,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:36:23,414 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:36:23,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23 WrapperNode [2020-07-01 12:36:23,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:36:23,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:23,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:36:23,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:36:23,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:36:23,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:36:23,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:36:23,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:36:23,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:36:23,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:36:23,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:36:23,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:36:23,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:36:23,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:36:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:36:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:36:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:36:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:36:23,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:36:23,916 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:36:23,916 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:36:23,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23 BoogieIcfgContainer [2020-07-01 12:36:23,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:36:23,921 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:36:23,922 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:36:23,924 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:36:23,924 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (1/1) ... [2020-07-01 12:36:23,941 INFO L313 BlockEncoder]: Initial Icfg 66 locations, 70 edges [2020-07-01 12:36:23,942 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:36:23,943 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:36:23,943 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:36:23,944 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:36:23,946 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:36:23,946 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:36:23,947 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:36:23,976 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:36:24,022 INFO L200 BlockEncoder]: SBE split 37 edges [2020-07-01 12:36:24,028 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:36:24,029 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:24,070 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:36:24,073 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:36:24,074 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:36:24,075 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:36:24,075 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:36:24,076 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:36:24,076 INFO L313 BlockEncoder]: Encoded RCFG 58 locations, 112 edges [2020-07-01 12:36:24,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:24 BasicIcfg [2020-07-01 12:36:24,077 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:36:24,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:36:24,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:36:24,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:36:24,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:36:23" (1/4) ... [2020-07-01 12:36:24,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74aa9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:24, skipping insertion in model container [2020-07-01 12:36:24,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (2/4) ... [2020-07-01 12:36:24,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74aa9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:36:24, skipping insertion in model container [2020-07-01 12:36:24,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (3/4) ... [2020-07-01 12:36:24,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74aa9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:24, skipping insertion in model container [2020-07-01 12:36:24,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:24" (4/4) ... [2020-07-01 12:36:24,085 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:24,096 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:36:24,103 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2020-07-01 12:36:24,117 INFO L251 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2020-07-01 12:36:24,141 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:36:24,141 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:36:24,141 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:24,141 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:24,141 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:24,141 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:36:24,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:24,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:36:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2020-07-01 12:36:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,165 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash 156428, now seen corresponding path program 1 times [2020-07-01 12:36:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477406245] [2020-07-01 12:36:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:24,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477406245] [2020-07-01 12:36:24,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567341241] [2020-07-01 12:36:24,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,366 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2020-07-01 12:36:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,593 INFO L93 Difference]: Finished difference Result 114 states and 207 transitions. [2020-07-01 12:36:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,607 INFO L225 Difference]: With dead ends: 114 [2020-07-01 12:36:24,607 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 12:36:24,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 12:36:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-07-01 12:36:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-01 12:36:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 97 transitions. [2020-07-01 12:36:24,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 97 transitions. Word has length 3 [2020-07-01 12:36:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,650 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 97 transitions. [2020-07-01 12:36:24,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 97 transitions. [2020-07-01 12:36:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:36:24,653 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 156552, now seen corresponding path program 1 times [2020-07-01 12:36:24,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312522540] [2020-07-01 12:36:24,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:24,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312522540] [2020-07-01 12:36:24,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434790769] [2020-07-01 12:36:24,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,723 INFO L87 Difference]: Start difference. First operand 58 states and 97 transitions. Second operand 3 states. [2020-07-01 12:36:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:24,882 INFO L93 Difference]: Finished difference Result 58 states and 97 transitions. [2020-07-01 12:36:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:24,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:24,884 INFO L225 Difference]: With dead ends: 58 [2020-07-01 12:36:24,885 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 12:36:24,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 12:36:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-01 12:36:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 12:36:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 87 transitions. [2020-07-01 12:36:24,892 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 87 transitions. Word has length 3 [2020-07-01 12:36:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:24,892 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 87 transitions. [2020-07-01 12:36:24,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2020-07-01 12:36:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:36:24,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:24,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:36:24,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:36:24,894 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 156554, now seen corresponding path program 1 times [2020-07-01 12:36:24,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:24,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389369408] [2020-07-01 12:36:24,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:24,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389369408] [2020-07-01 12:36:24,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:24,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:24,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190121582] [2020-07-01 12:36:24,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:24,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:24,948 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand 3 states. [2020-07-01 12:36:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,103 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2020-07-01 12:36:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:36:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,105 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:36:25,105 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 12:36:25,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 12:36:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-01 12:36:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 12:36:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2020-07-01 12:36:25,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 3 [2020-07-01 12:36:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,112 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2020-07-01 12:36:25,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2020-07-01 12:36:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:36:25,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:36:25,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:36:25,114 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 4850453, now seen corresponding path program 1 times [2020-07-01 12:36:25,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969275498] [2020-07-01 12:36:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969275498] [2020-07-01 12:36:25,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354143400] [2020-07-01 12:36:25,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,157 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 3 states. [2020-07-01 12:36:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,270 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2020-07-01 12:36:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:36:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,272 INFO L225 Difference]: With dead ends: 48 [2020-07-01 12:36:25,272 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:36:25,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:36:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:36:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:36:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-07-01 12:36:25,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 4 [2020-07-01 12:36:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,278 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-07-01 12:36:25,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-07-01 12:36:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:36:25,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:36:25,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:36:25,279 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash 4850454, now seen corresponding path program 1 times [2020-07-01 12:36:25,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191755773] [2020-07-01 12:36:25,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191755773] [2020-07-01 12:36:25,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324499492] [2020-07-01 12:36:25,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,329 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2020-07-01 12:36:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,424 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2020-07-01 12:36:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:36:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,425 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:36:25,425 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:36:25,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:36:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 12:36:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 12:36:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 57 transitions. [2020-07-01 12:36:25,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 57 transitions. Word has length 4 [2020-07-01 12:36:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,431 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 57 transitions. [2020-07-01 12:36:25,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 57 transitions. [2020-07-01 12:36:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:36:25,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:36:25,432 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash 150361046, now seen corresponding path program 1 times [2020-07-01 12:36:25,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016878021] [2020-07-01 12:36:25,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016878021] [2020-07-01 12:36:25,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677289535] [2020-07-01 12:36:25,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,468 INFO L87 Difference]: Start difference. First operand 38 states and 57 transitions. Second operand 3 states. [2020-07-01 12:36:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,540 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2020-07-01 12:36:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:36:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,541 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:36:25,541 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:36:25,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:36:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:36:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:36:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2020-07-01 12:36:25,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 5 [2020-07-01 12:36:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,546 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2020-07-01 12:36:25,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2020-07-01 12:36:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:36:25,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:36:25,548 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 150361048, now seen corresponding path program 1 times [2020-07-01 12:36:25,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369335346] [2020-07-01 12:36:25,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369335346] [2020-07-01 12:36:25,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192342501] [2020-07-01 12:36:25,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,582 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 3 states. [2020-07-01 12:36:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,637 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2020-07-01 12:36:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:36:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,638 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:36:25,639 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:36:25,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:36:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:36:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:36:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2020-07-01 12:36:25,644 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 5 [2020-07-01 12:36:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,644 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-01 12:36:25,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-07-01 12:36:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:36:25,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:36:25,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:36:25,645 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 150361049, now seen corresponding path program 1 times [2020-07-01 12:36:25,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670678139] [2020-07-01 12:36:25,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670678139] [2020-07-01 12:36:25,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339653958] [2020-07-01 12:36:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,684 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 3 states. [2020-07-01 12:36:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,746 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-07-01 12:36:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:36:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,747 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:36:25,747 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:36:25,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:36:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:36:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:36:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2020-07-01 12:36:25,751 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 5 [2020-07-01 12:36:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,752 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2020-07-01 12:36:25,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2020-07-01 12:36:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:25,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:25,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:36:25,753 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 366222850, now seen corresponding path program 1 times [2020-07-01 12:36:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767619400] [2020-07-01 12:36:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767619400] [2020-07-01 12:36:25,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923931777] [2020-07-01 12:36:25,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,788 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand 3 states. [2020-07-01 12:36:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,858 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2020-07-01 12:36:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,860 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:36:25,860 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:36:25,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:36:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:36:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:36:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2020-07-01 12:36:25,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 6 [2020-07-01 12:36:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,864 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2020-07-01 12:36:25,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2020-07-01 12:36:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:25,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:25,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:36:25,865 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 366222852, now seen corresponding path program 1 times [2020-07-01 12:36:25,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607994077] [2020-07-01 12:36:25,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607994077] [2020-07-01 12:36:25,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176994064] [2020-07-01 12:36:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,896 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 3 states. [2020-07-01 12:36:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:25,924 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-01 12:36:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:25,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:25,925 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:36:25,925 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:36:25,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:36:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:36:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:36:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-07-01 12:36:25,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 6 [2020-07-01 12:36:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:25,929 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-07-01 12:36:25,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-01 12:36:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:36:25,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:36:25,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:25,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:36:25,930 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:36:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash 366222853, now seen corresponding path program 1 times [2020-07-01 12:36:25,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:25,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054904690] [2020-07-01 12:36:25,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:25,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054904690] [2020-07-01 12:36:25,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:25,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:25,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995814663] [2020-07-01 12:36:25,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:36:25,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:25,962 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2020-07-01 12:36:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:26,006 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-01 12:36:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:26,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:36:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:36:26,007 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:36:26,007 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:36:26,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:36:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:36:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:36:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:36:26,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 12:36:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:36:26,009 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:36:26,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:36:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:36:26,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:36:26,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:36:26,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:36:26,087 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,087 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,087 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,087 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,087 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L15-7(lines 15 21) no Hoare annotation was computed. [2020-07-01 12:36:26,088 INFO L268 CegarLoopResult]: For program point L15-9(lines 15 21) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,089 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 20) no Hoare annotation was computed. [2020-07-01 12:36:26,090 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:36:26,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:36:26,091 INFO L264 CegarLoopResult]: At program point L16-4(lines 16 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 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) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:36:26,091 INFO L264 CegarLoopResult]: At program point L16-5(lines 14 21) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 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) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:36:26,091 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,092 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,093 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:36:26,094 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:36:26,097 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:36:26,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:26 BasicIcfg [2020-07-01 12:36:26,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:36:26,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:36:26,124 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:36:26,127 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:36:26,128 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:26,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:36:23" (1/5) ... [2020-07-01 12:36:26,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430928df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:26, skipping insertion in model container [2020-07-01 12:36:26,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:26,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:36:23" (2/5) ... [2020-07-01 12:36:26,130 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430928df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:36:26, skipping insertion in model container [2020-07-01 12:36:26,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:26,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:36:23" (3/5) ... [2020-07-01 12:36:26,130 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430928df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:26, skipping insertion in model container [2020-07-01 12:36:26,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:26,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:36:24" (4/5) ... [2020-07-01 12:36:26,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430928df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:36:26, skipping insertion in model container [2020-07-01 12:36:26,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:36:26,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:36:26" (5/5) ... [2020-07-01 12:36:26,132 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:36:26,154 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:36:26,154 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:36:26,155 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:36:26,155 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:36:26,155 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:36:26,155 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:36:26,155 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:36:26,155 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:36:26,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states. [2020-07-01 12:36:26,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 12:36:26,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:26,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:26,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:26,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:26,172 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:36:26,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states. [2020-07-01 12:36:26,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 12:36:26,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:36:26,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:36:26,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:36:26,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:36:26,181 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [125] 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] 11#L-1true [218] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.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_~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_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.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_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store (store (store |v_#length_5| |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) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} 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_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_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~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_~z=v_ULTIMATE.start_test_fun_~z_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_#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_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_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_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_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_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, 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_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 28#L11true [126] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_8| 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_8|, #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_6|, 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_8|, #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_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 25#L11-1true [120] L11-1-->L12: 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))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| 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_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, 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_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, 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] 46#L12true [146] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 59#L13true [162] L13-->L16-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, 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_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, 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_14|} AuxVars[] AssignedVars[#memory_int] 45#L16-5true [2020-07-01 12:36:26,182 INFO L796 eck$LassoCheckResult]: Loop: 45#L16-5true [143] L16-5-->L15: Formula: (and (= 1 (select |v_#valid_16| 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~mem4_2| (select (select |v_#memory_int_9| 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_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, 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~mem4] 18#L15true [109] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_10| 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~mem5_2|)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, 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_18|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, 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~mem5] 34#L15-1true [247] L15-1-->L15-2: Formula: (and (> |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 33#L15-2true [137] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 9#L15-7true [106] L15-7-->L16-4: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 47#L16-4true [150] L16-4-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 36#L16-1true [139] L16-1-->L16-2: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 51#L16-2true [190] L16-2-->L16-5: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 45#L16-5true [2020-07-01 12:36:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 376381512, now seen corresponding path program 1 times [2020-07-01 12:36:26,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:26,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592329371] [2020-07-01 12:36:26,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:26,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592329371] [2020-07-01 12:36:26,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:26,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:36:26,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640383379] [2020-07-01 12:36:26,202 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:36:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:36:26,202 INFO L82 PathProgramCache]: Analyzing trace with hash -833764432, now seen corresponding path program 1 times [2020-07-01 12:36:26,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:36:26,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733407878] [2020-07-01 12:36:26,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:36:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:36:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:36:26,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733407878] [2020-07-01 12:36:26,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:36:26,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:36:26,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222151837] [2020-07-01 12:36:26,215 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:36:26,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:36:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:36:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:36:26,217 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2020-07-01 12:36:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:36:26,338 INFO L93 Difference]: Finished difference Result 58 states and 97 transitions. [2020-07-01 12:36:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:36:26,341 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:36:26,346 INFO L168 Benchmark]: Toolchain (without parser) took 3248.48 ms. Allocated memory was 649.6 MB in the beginning and 750.8 MB in the end (delta: 101.2 MB). Free memory was 562.6 MB in the beginning and 626.4 MB in the end (delta: -63.8 MB). Peak memory consumption was 37.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,346 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:36:26,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.16 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 562.6 MB in the beginning and 651.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.23 ms. Allocated memory is still 690.0 MB. Free memory was 651.9 MB in the beginning and 650.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,348 INFO L168 Benchmark]: Boogie Preprocessor took 26.14 ms. Allocated memory is still 690.0 MB. Free memory was 650.5 MB in the beginning and 647.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,348 INFO L168 Benchmark]: RCFGBuilder took 436.03 ms. Allocated memory is still 690.0 MB. Free memory was 647.8 MB in the beginning and 616.2 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,349 INFO L168 Benchmark]: BlockEncodingV2 took 155.40 ms. Allocated memory is still 690.0 MB. Free memory was 616.2 MB in the beginning and 601.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,350 INFO L168 Benchmark]: TraceAbstraction took 2045.50 ms. Allocated memory was 690.0 MB in the beginning and 750.8 MB in the end (delta: 60.8 MB). Free memory was 601.4 MB in the beginning and 662.7 MB in the end (delta: -61.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:36:26,350 INFO L168 Benchmark]: BuchiAutomizer took 219.20 ms. Allocated memory is still 750.8 MB. Free memory was 662.7 MB in the beginning and 626.4 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:36:26,353 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 66 locations, 70 edges - StatisticsResult: Encoded RCFG 58 locations, 112 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 318.16 ms. Allocated memory was 649.6 MB in the beginning and 690.0 MB in the end (delta: 40.4 MB). Free memory was 562.6 MB in the beginning and 651.9 MB in the end (delta: -89.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.23 ms. Allocated memory is still 690.0 MB. Free memory was 651.9 MB in the beginning and 650.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.14 ms. Allocated memory is still 690.0 MB. Free memory was 650.5 MB in the beginning and 647.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 436.03 ms. Allocated memory is still 690.0 MB. Free memory was 647.8 MB in the beginning and 616.2 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 155.40 ms. Allocated memory is still 690.0 MB. Free memory was 616.2 MB in the beginning and 601.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2045.50 ms. Allocated memory was 690.0 MB in the beginning and 750.8 MB in the end (delta: 60.8 MB). Free memory was 601.4 MB in the beginning and 662.7 MB in the end (delta: -61.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 219.20 ms. Allocated memory is still 750.8 MB. Free memory was 662.7 MB in the beginning and 626.4 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 14]: 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: 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: 15]: 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: 15]: 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: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 17]: 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 - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:36:26,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,364 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:36:26,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:36:26,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:36:26,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 34 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 108 SDtfs, 590 SDslu, 6 SDs, 0 SdLazy, 524 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 112 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, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:36:19.847 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_SZGOtD/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:36:26.596 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check