/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:56:38,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:56:38,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:56:38,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:56:38,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:56:38,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:56:38,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:56:38,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:56:38,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:56:38,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:56:38,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:56:38,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:56:38,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:56:38,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:56:38,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:56:38,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:56:38,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:56:38,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:56:38,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:56:38,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:56:38,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:56:38,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:56:38,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:56:38,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:56:38,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:56:38,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:56:38,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:56:38,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:56:38,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:56:38,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:56:38,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:56:38,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:56:38,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:56:38,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:56:38,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:56:38,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:56:38,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:56:38,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:56:38,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:56:38,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:56:38,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:56:38,318 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:56:38,332 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:56:38,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:56:38,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:56:38,333 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:56:38,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:56:38,334 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:38,334 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:56:38,334 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:56:38,334 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:56:38,334 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:56:38,334 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:56:38,335 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:56:38,335 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:56:38,335 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:56:38,335 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:56:38,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:56:38,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:56:38,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:56:38,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:56:38,336 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:56:38,336 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:56:38,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:56:38,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:56:38,337 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:56:38,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:56:38,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:56:38,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:56:38,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:56:38,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:56:38,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:56:38,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:56:38,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:56:38,521 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:56:38,521 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:56:38,522 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:56:38,582 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_I5XZW9/tmp/ab10ff119eeb415cb13ab201af4f71d3/FLAG3300cc2bf [2020-07-01 12:56:38,917 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:56:38,918 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:56:38,918 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:56:38,924 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_I5XZW9/tmp/ab10ff119eeb415cb13ab201af4f71d3/FLAG3300cc2bf [2020-07-01 12:56:39,328 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_I5XZW9/tmp/ab10ff119eeb415cb13ab201af4f71d3 [2020-07-01 12:56:39,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:56:39,340 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:56:39,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:39,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:56:39,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:56:39,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727be3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39, skipping insertion in model container [2020-07-01 12:56:39,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:56:39,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:56:39,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:39,620 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:56:39,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:39,654 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:56:39,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39 WrapperNode [2020-07-01 12:56:39,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:39,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:39,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:56:39,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:56:39,665 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:56:39" (1/1) ... [2020-07-01 12:56:39,674 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:56:39" (1/1) ... [2020-07-01 12:56:39,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:39,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:56:39,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:56:39,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:56:39,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (1/1) ... [2020-07-01 12:56:39,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:56:39,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:56:39,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:56:39,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:56:39,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (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:56:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:56:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:56:39,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:56:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:56:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:56:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:56:40,089 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:56:40,089 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:56:40,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:40 BoogieIcfgContainer [2020-07-01 12:56:40,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:56:40,094 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:56:40,094 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:56:40,096 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:56:40,097 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:40" (1/1) ... [2020-07-01 12:56:40,113 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 55 edges [2020-07-01 12:56:40,114 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:56:40,115 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:56:40,115 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:56:40,116 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:40,118 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:56:40,119 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:56:40,119 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:56:40,145 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:56:40,179 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:56:40,184 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:56:40,186 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:40,213 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:56:40,216 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-07-01 12:56:40,217 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:56:40,217 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:40,218 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:56:40,218 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:56:40,219 INFO L313 BlockEncoder]: Encoded RCFG 43 locations, 74 edges [2020-07-01 12:56:40,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:40 BasicIcfg [2020-07-01 12:56:40,220 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:56:40,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:56:40,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:56:40,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:56:40,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:56:39" (1/4) ... [2020-07-01 12:56:40,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6b6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:40, skipping insertion in model container [2020-07-01 12:56:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (2/4) ... [2020-07-01 12:56:40,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6b6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:40, skipping insertion in model container [2020-07-01 12:56:40,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:40" (3/4) ... [2020-07-01 12:56:40,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6b6f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:40, skipping insertion in model container [2020-07-01 12:56:40,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:40" (4/4) ... [2020-07-01 12:56:40,228 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:40,240 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:56:40,248 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-07-01 12:56:40,261 INFO L251 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-07-01 12:56:40,285 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:56:40,285 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:56:40,285 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:40,286 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:40,286 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:40,286 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:56:40,286 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:40,286 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:56:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-01 12:56:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:40,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:40,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:40,309 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash 246337, now seen corresponding path program 1 times [2020-07-01 12:56:40,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:40,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421457957] [2020-07-01 12:56:40,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:40,479 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:56:40,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421457957] [2020-07-01 12:56:40,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:40,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:40,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818428955] [2020-07-01 12:56:40,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:40,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:40,504 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 12:56:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:40,639 INFO L93 Difference]: Finished difference Result 84 states and 143 transitions. [2020-07-01 12:56:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:40,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:40,653 INFO L225 Difference]: With dead ends: 84 [2020-07-01 12:56:40,653 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:56:40,657 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:56:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:56:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:56:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:56:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 71 transitions. [2020-07-01 12:56:40,697 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 71 transitions. Word has length 3 [2020-07-01 12:56:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:40,698 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 71 transitions. [2020-07-01 12:56:40,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 71 transitions. [2020-07-01 12:56:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:40,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:40,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:40,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:56:40,700 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 246399, now seen corresponding path program 1 times [2020-07-01 12:56:40,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:40,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563638541] [2020-07-01 12:56:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:40,756 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:56:40,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563638541] [2020-07-01 12:56:40,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:40,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:40,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518480126] [2020-07-01 12:56:40,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:40,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:40,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:40,759 INFO L87 Difference]: Start difference. First operand 43 states and 71 transitions. Second operand 3 states. [2020-07-01 12:56:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:40,875 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2020-07-01 12:56:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:40,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:40,876 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:56:40,876 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:56:40,878 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:56:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:56:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:56:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:56:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2020-07-01 12:56:40,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 3 [2020-07-01 12:56:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:40,883 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-07-01 12:56:40,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions. [2020-07-01 12:56:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:40,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:40,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:40,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:56:40,884 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 246401, now seen corresponding path program 1 times [2020-07-01 12:56:40,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:40,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050917504] [2020-07-01 12:56:40,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:40,924 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:56:40,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050917504] [2020-07-01 12:56:40,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:40,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:40,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125894801] [2020-07-01 12:56:40,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:40,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:40,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:40,926 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. Second operand 3 states. [2020-07-01 12:56:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:41,017 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2020-07-01 12:56:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:41,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:41,018 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:56:41,018 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:56:41,019 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:56:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:56:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:56:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:56:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-01 12:56:41,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 3 [2020-07-01 12:56:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:41,023 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-01 12:56:41,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-01 12:56:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:56:41,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:41,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:56:41,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:56:41,025 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 7636121, now seen corresponding path program 1 times [2020-07-01 12:56:41,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:41,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132903491] [2020-07-01 12:56:41,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:41,052 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:56:41,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132903491] [2020-07-01 12:56:41,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:41,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135900737] [2020-07-01 12:56:41,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:41,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:41,055 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 3 states. [2020-07-01 12:56:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:41,111 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-01 12:56:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:41,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:56:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:41,112 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:41,113 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:56:41,113 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:56:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:56:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:56:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:56:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-01 12:56:41,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 4 [2020-07-01 12:56:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:41,117 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-01 12:56:41,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-01 12:56:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:56:41,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:41,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:56:41,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:56:41,118 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 7636123, now seen corresponding path program 1 times [2020-07-01 12:56:41,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:41,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461953352] [2020-07-01 12:56:41,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:41,144 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:56:41,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461953352] [2020-07-01 12:56:41,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:41,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:41,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698671781] [2020-07-01 12:56:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:41,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:41,146 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 3 states. [2020-07-01 12:56:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:41,187 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-01 12:56:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:41,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:56:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:41,189 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:56:41,189 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:56:41,189 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:56:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:56:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:56:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:56:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-01 12:56:41,193 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 4 [2020-07-01 12:56:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:41,193 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-01 12:56:41,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-01 12:56:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:56:41,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:41,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:56:41,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:56:41,195 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 7636124, now seen corresponding path program 1 times [2020-07-01 12:56:41,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:41,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186888590] [2020-07-01 12:56:41,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:41,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186888590] [2020-07-01 12:56:41,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:41,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:41,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836921669] [2020-07-01 12:56:41,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:41,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:41,232 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-01 12:56:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:41,290 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-01 12:56:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:41,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:56:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:41,291 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:56:41,292 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:56:41,292 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:56:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:56:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:56:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:56:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:56:41,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:56:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:41,293 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:56:41,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:56:41,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:56:41,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:56:41,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:56:41,330 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,330 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,330 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point L11-3(lines 11 17) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,331 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,332 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,333 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:41,333 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 16) no Hoare annotation was computed. [2020-07-01 12:56:41,333 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:56:41,333 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:56:41,333 INFO L264 CegarLoopResult]: At program point L12-4(lines 9 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_gcd_~y2_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~y2_ref~0.base)) (= 0 ULTIMATE.start_gcd_~y1_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_gcd_~y1_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_gcd_~y1_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_gcd_~y2_ref~0.base))) [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:41,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:56:41,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:41,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:41,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:41,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:56:41,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:41,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:56:41,339 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:56:41,348 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:41,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:41,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:41 BasicIcfg [2020-07-01 12:56:41,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:56:41,360 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:56:41,361 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:56:41,364 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:56:41,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:41,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:56:39" (1/5) ... [2020-07-01 12:56:41,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585cb552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:41, skipping insertion in model container [2020-07-01 12:56:41,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:41,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:39" (2/5) ... [2020-07-01 12:56:41,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585cb552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:41, skipping insertion in model container [2020-07-01 12:56:41,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:41,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:40" (3/5) ... [2020-07-01 12:56:41,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585cb552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:41, skipping insertion in model container [2020-07-01 12:56:41,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:41,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:40" (4/5) ... [2020-07-01 12:56:41,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585cb552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:41, skipping insertion in model container [2020-07-01 12:56:41,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:41,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:41" (5/5) ... [2020-07-01 12:56:41,369 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:41,393 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:56:41,393 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:56:41,393 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:41,393 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:41,393 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:41,393 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:56:41,394 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:41,394 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:56:41,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 12:56:41,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:56:41,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:41,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:41,411 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:56:41,411 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:41,411 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:56:41,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2020-07-01 12:56:41,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:56:41,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:41,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:41,415 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:56:41,415 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:41,421 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [220] ULTIMATE.startENTRY-->L24: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_35| (store |v_#valid_36| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_36|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_6, #valid=|v_#valid_35|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~y1~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y2~0, #valid, #NULL.offset, #NULL.base] 42#L24true [163] L24-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (= v_ULTIMATE.start_gcd_~y2_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_gcd_~y2_1 |v_ULTIMATE.start_gcd_#in~y2_1|) (<= 0 v_ULTIMATE.start_main_~y1~0_4) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= v_ULTIMATE.start_gcd_~y1_1 |v_ULTIMATE.start_gcd_#in~y1_1|) (<= 0 v_ULTIMATE.start_main_~y2~0_4) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_gcd_~y1_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (= |v_ULTIMATE.start_gcd_#in~y1_1| v_ULTIMATE.start_main_~y1~0_4) (= v_ULTIMATE.start_gcd_~y1_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_gcd_~y2_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_gcd_#in~y2_1| v_ULTIMATE.start_main_~y2~0_4) (> 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_1, ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_1, ULTIMATE.start_gcd_#in~y2=|v_ULTIMATE.start_gcd_#in~y2_1|, ULTIMATE.start_gcd_#in~y1=|v_ULTIMATE.start_gcd_#in~y1_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_1, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_main_~y2~0=v_ULTIMATE.start_main_~y2~0_4, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_1, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_~y1~0=v_ULTIMATE.start_main_~y1~0_4, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_gcd_~y2, ULTIMATE.start_gcd_~y1, ULTIMATE.start_gcd_#in~y2, ULTIMATE.start_gcd_#in~y1, ULTIMATE.start_gcd_~y1_ref~0.offset, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_~y2_ref~0.base, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_~y1_ref~0.base, ULTIMATE.start_gcd_#t~mem2, #valid, #length, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~y2_ref~0.offset] 28#L8true [88] L8-->L8-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_gcd_~y1_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~y1_ref~0.base_3) v_ULTIMATE.start_gcd_~y1_ref~0.offset_3 v_ULTIMATE.start_gcd_~y1_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} OutVars{ULTIMATE.start_gcd_~y1=v_ULTIMATE.start_gcd_~y1_3, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_3, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 26#L8-1true [85] L8-1-->L12-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y2_ref~0.base_3) v_ULTIMATE.start_gcd_~y2_ref~0.offset_3 v_ULTIMATE.start_gcd_~y2_3)))) InVars {ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} OutVars{ULTIMATE.start_gcd_~y2=v_ULTIMATE.start_gcd_~y2_3, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 29#L12-4true [2020-07-01 12:56:41,422 INFO L796 eck$LassoCheckResult]: Loop: 29#L12-4true [92] L12-4-->L11: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~y1_ref~0.base_6) v_ULTIMATE.start_gcd_~y1_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_gcd_~y1_ref~0.base_6)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_gcd_~y1_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_6, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_5, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 35#L11true [98] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_gcd_~y2_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_gcd_~y2_ref~0.base_6) v_ULTIMATE.start_gcd_~y2_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_6, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 32#L11-1true [186] L11-1-->L12: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 19#L12true [114] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1_ref~0.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_7) (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1_ref~0.base_9) v_ULTIMATE.start_gcd_~y1_ref~0.offset_7)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_9, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_7, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 17#L12-1true [111] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2_ref~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2_ref~0.base_9) v_ULTIMATE.start_gcd_~y2_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_9, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 15#L12-2true [147] L12-2-->L15: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| |v_ULTIMATE.start_gcd_#t~mem4_6|) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4] 22#L15true [82] L15-->L15-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y2_ref~0.base_15) v_ULTIMATE.start_gcd_~y2_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_gcd_~y2_ref~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_11) (= 1 (select |v_#valid_24| v_ULTIMATE.start_gcd_~y2_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_15, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_11, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_15, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 44#L15-1true [105] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1_ref~0.offset_13 4) (select |v_#length_24| v_ULTIMATE.start_gcd_~y1_ref~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start_gcd_~y1_ref~0.base_18)) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~y1_ref~0.base_18) v_ULTIMATE.start_gcd_~y1_ref~0.offset_13)) (<= 0 v_ULTIMATE.start_gcd_~y1_ref~0.offset_13)) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_13, #length=|v_#length_24|, ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_18, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_gcd_~y1_ref~0.base=v_ULTIMATE.start_gcd_~y1_ref~0.base_18, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_gcd_~y1_ref~0.offset=v_ULTIMATE.start_gcd_~y1_ref~0.offset_13, #length=|v_#length_24|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 41#L15-2true [226] L15-2-->L12-4: Formula: (and (= 1 (select |v_#valid_42| v_ULTIMATE.start_gcd_~y2_ref~0.base_21)) (= (store |v_#memory_int_23| v_ULTIMATE.start_gcd_~y2_ref~0.base_21 (store (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y2_ref~0.base_21) v_ULTIMATE.start_gcd_~y2_ref~0.offset_15 (+ |v_ULTIMATE.start_gcd_#t~mem8_6| (* |v_ULTIMATE.start_gcd_#t~mem9_6| (- 1))))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_gcd_~y2_ref~0.offset_15 4) (select |v_#length_33| v_ULTIMATE.start_gcd_~y2_ref~0.base_21)) (<= 0 v_ULTIMATE.start_gcd_~y2_ref~0.offset_15)) InVars {ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_21, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_33|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_6|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_15} OutVars{ULTIMATE.start_gcd_~y2_ref~0.base=v_ULTIMATE.start_gcd_~y2_ref~0.base_21, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_5|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~y2_ref~0.offset=v_ULTIMATE.start_gcd_~y2_ref~0.offset_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8] 29#L12-4true [2020-07-01 12:56:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash 7636997, now seen corresponding path program 1 times [2020-07-01 12:56:41,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:41,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523507530] [2020-07-01 12:56:41,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:41,448 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:56:41,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523507530] [2020-07-01 12:56:41,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:41,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:41,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492712819] [2020-07-01 12:56:41,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:56:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash 960777160, now seen corresponding path program 1 times [2020-07-01 12:56:41,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:41,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794955766] [2020-07-01 12:56:41,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:41,518 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:56:41,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794955766] [2020-07-01 12:56:41,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:41,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:56:41,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780356239] [2020-07-01 12:56:41,520 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:56:41,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:41,522 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-01 12:56:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:41,599 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2020-07-01 12:56:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:41,601 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:56:41,606 INFO L168 Benchmark]: Toolchain (without parser) took 2264.94 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 561.6 MB in the beginning and 460.9 MB in the end (delta: 100.6 MB). Peak memory consumption was 143.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,606 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:56:41,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.63 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 561.6 MB in the beginning and 654.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.60 ms. Allocated memory is still 692.1 MB. Free memory was 654.1 MB in the beginning and 651.5 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:56:41,608 INFO L168 Benchmark]: Boogie Preprocessor took 24.11 ms. Allocated memory is still 692.1 MB. Free memory was 651.5 MB in the beginning and 650.1 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:56:41,609 INFO L168 Benchmark]: RCFGBuilder took 372.01 ms. Allocated memory is still 692.1 MB. Free memory was 650.1 MB in the beginning and 622.5 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,610 INFO L168 Benchmark]: BlockEncodingV2 took 125.66 ms. Allocated memory is still 692.1 MB. Free memory was 622.5 MB in the beginning and 611.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,610 INFO L168 Benchmark]: TraceAbstraction took 1138.54 ms. Allocated memory is still 692.1 MB. Free memory was 611.7 MB in the beginning and 492.0 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,611 INFO L168 Benchmark]: BuchiAutomizer took 242.91 ms. Allocated memory is still 692.1 MB. Free memory was 492.0 MB in the beginning and 460.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:41,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 55 edges - StatisticsResult: Encoded RCFG 43 locations, 74 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 313.63 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 561.6 MB in the beginning and 654.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.60 ms. Allocated memory is still 692.1 MB. Free memory was 654.1 MB in the beginning and 651.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.11 ms. Allocated memory is still 692.1 MB. Free memory was 651.5 MB in the beginning and 650.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 372.01 ms. Allocated memory is still 692.1 MB. Free memory was 650.1 MB in the beginning and 622.5 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.66 ms. Allocated memory is still 692.1 MB. Free memory was 622.5 MB in the beginning and 611.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1138.54 ms. Allocated memory is still 692.1 MB. Free memory was 611.7 MB in the beginning and 492.0 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 242.91 ms. Allocated memory is still 692.1 MB. Free memory was 492.0 MB in the beginning and 460.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 8]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: 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 - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:56:41,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:41,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:41,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:41,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((0 == y2_ref && 4 == unknown-#length-unknown[y2_ref]) && 0 == y1_ref) && 1 == \valid[y1_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[y1_ref]) && 1 == \valid[y2_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 26 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 229 SDslu, 3 SDs, 0 SdLazy, 212 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:56:36.109 ----------------------------------------------- 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_I5XZW9/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:56:41.852 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check