/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 13:00:52,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:00:52,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:00:52,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:00:52,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:00:52,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:00:52,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:00:52,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:00:52,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:00:52,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:00:52,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:00:52,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:00:52,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:00:52,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:00:52,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:00:52,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:00:52,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:00:52,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:00:52,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:00:52,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:00:52,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:00:52,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:00:52,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:00:52,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:00:52,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:00:52,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:00:52,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:00:52,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:00:52,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:00:52,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:00:52,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:00:52,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:00:52,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:00:52,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:00:52,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:00:52,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:00:52,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:00:52,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:00:52,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:00:52,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:00:52,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:00:52,543 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:00:52,558 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:00:52,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:00:52,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:00:52,559 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:00:52,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:00:52,560 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:00:52,560 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:00:52,560 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:00:52,560 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:00:52,560 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:00:52,561 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:00:52,561 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:00:52,561 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:00:52,561 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:00:52,561 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:00:52,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:00:52,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:00:52,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:00:52,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:00:52,562 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:00:52,562 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:00:52,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:00:52,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:00:52,563 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:00:52,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:00:52,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:00:52,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:00:52,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:00:52,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:00:52,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:00:52,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:00:52,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:00:52,753 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:00:52,753 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:00:52,754 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:00:52,823 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_wxFzay/tmp/8626d3909af2406796f971d01837fb8a/FLAGa18887de8 [2020-07-01 13:00:53,176 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:00:53,177 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:00:53,177 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:00:53,184 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_wxFzay/tmp/8626d3909af2406796f971d01837fb8a/FLAGa18887de8 [2020-07-01 13:00:53,585 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_wxFzay/tmp/8626d3909af2406796f971d01837fb8a [2020-07-01 13:00:53,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:00:53,598 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:00:53,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:00:53,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:00:53,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:00:53,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648b6588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53, skipping insertion in model container [2020-07-01 13:00:53,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:00:53,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:00:53,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:00:53,871 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:00:53,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:00:53,904 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:00:53,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53 WrapperNode [2020-07-01 13:00:53,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:00:53,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:00:53,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:00:53,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:00:53,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:00:53,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:00:53,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:00:53,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:00:53,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (1/1) ... [2020-07-01 13:00:53,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:00:53,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:00:53,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:00:53,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:00:53,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (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 13:00:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:00:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:00:54,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:00:54,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:00:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:00:54,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:00:54,430 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:00:54,430 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:00:54,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:54 BoogieIcfgContainer [2020-07-01 13:00:54,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:00:54,436 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:00:54,436 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:00:54,438 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:00:54,439 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:54" (1/1) ... [2020-07-01 13:00:54,455 INFO L313 BlockEncoder]: Initial Icfg 68 locations, 72 edges [2020-07-01 13:00:54,457 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:00:54,457 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:00:54,458 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:00:54,458 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:00:54,460 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:00:54,461 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:00:54,461 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:00:54,490 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:00:54,530 INFO L200 BlockEncoder]: SBE split 38 edges [2020-07-01 13:00:54,535 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:00:54,537 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:00:54,561 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:00:54,564 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:00:54,566 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:00:54,566 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:00:54,567 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:00:54,567 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:00:54,568 INFO L313 BlockEncoder]: Encoded RCFG 59 locations, 105 edges [2020-07-01 13:00:54,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:54 BasicIcfg [2020-07-01 13:00:54,568 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:00:54,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:00:54,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:00:54,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:00:54,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:00:53" (1/4) ... [2020-07-01 13:00:54,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2eb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:00:54, skipping insertion in model container [2020-07-01 13:00:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (2/4) ... [2020-07-01 13:00:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2eb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:00:54, skipping insertion in model container [2020-07-01 13:00:54,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:54" (3/4) ... [2020-07-01 13:00:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2eb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:54, skipping insertion in model container [2020-07-01 13:00:54,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:54" (4/4) ... [2020-07-01 13:00:54,577 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:00:54,588 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:00:54,596 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2020-07-01 13:00:54,610 INFO L251 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2020-07-01 13:00:54,633 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:00:54,634 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:00:54,634 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:00:54,634 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:00:54,634 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:00:54,634 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:00:54,634 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:00:54,635 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:00:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-01 13:00:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:54,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:54,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:54,658 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash 158500, now seen corresponding path program 1 times [2020-07-01 13:00:54,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:54,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978242457] [2020-07-01 13:00:54,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:54,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978242457] [2020-07-01 13:00:54,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:54,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:54,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691525634] [2020-07-01 13:00:54,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:54,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:54,856 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-01 13:00:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,037 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2020-07-01 13:00:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,051 INFO L225 Difference]: With dead ends: 116 [2020-07-01 13:00:55,052 INFO L226 Difference]: Without dead ends: 59 [2020-07-01 13:00:55,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-01 13:00:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-01 13:00:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-01 13:00:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 98 transitions. [2020-07-01 13:00:55,096 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 98 transitions. Word has length 3 [2020-07-01 13:00:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,096 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 98 transitions. [2020-07-01 13:00:55,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 98 transitions. [2020-07-01 13:00:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:55,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:55,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:00:55,099 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash 158562, now seen corresponding path program 1 times [2020-07-01 13:00:55,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557790002] [2020-07-01 13:00:55,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557790002] [2020-07-01 13:00:55,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336640475] [2020-07-01 13:00:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,160 INFO L87 Difference]: Start difference. First operand 59 states and 98 transitions. Second operand 3 states. [2020-07-01 13:00:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,323 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2020-07-01 13:00:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,325 INFO L225 Difference]: With dead ends: 59 [2020-07-01 13:00:55,326 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:00:55,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:00:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:00:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:00:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2020-07-01 13:00:55,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 3 [2020-07-01 13:00:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,333 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2020-07-01 13:00:55,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2020-07-01 13:00:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:55,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:55,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:00:55,335 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash 158564, now seen corresponding path program 1 times [2020-07-01 13:00:55,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122367801] [2020-07-01 13:00:55,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122367801] [2020-07-01 13:00:55,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063710392] [2020-07-01 13:00:55,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,363 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand 3 states. [2020-07-01 13:00:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,453 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-01 13:00:55,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,455 INFO L225 Difference]: With dead ends: 59 [2020-07-01 13:00:55,455 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:00:55,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:00:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:00:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:00:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2020-07-01 13:00:55,462 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 3 [2020-07-01 13:00:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,462 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2020-07-01 13:00:55,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2020-07-01 13:00:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:00:55,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:00:55,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:00:55,463 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash 158565, now seen corresponding path program 1 times [2020-07-01 13:00:55,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609489749] [2020-07-01 13:00:55,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609489749] [2020-07-01 13:00:55,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157419741] [2020-07-01 13:00:55,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,513 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand 3 states. [2020-07-01 13:00:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,627 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2020-07-01 13:00:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:00:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,628 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:00:55,629 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:00:55,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:00:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 13:00:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:00:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-07-01 13:00:55,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 3 [2020-07-01 13:00:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,634 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-07-01 13:00:55,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-07-01 13:00:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:00:55,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:00:55,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:00:55,636 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash 4912261, now seen corresponding path program 1 times [2020-07-01 13:00:55,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531649381] [2020-07-01 13:00:55,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531649381] [2020-07-01 13:00:55,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094685060] [2020-07-01 13:00:55,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,676 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 3 states. [2020-07-01 13:00:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,776 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-07-01 13:00:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:00:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,777 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:00:55,777 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:00:55,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:00:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-01 13:00:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-01 13:00:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2020-07-01 13:00:55,782 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 4 [2020-07-01 13:00:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,782 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2020-07-01 13:00:55,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2020-07-01 13:00:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:00:55,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:00:55,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:00:55,783 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash 4912263, now seen corresponding path program 1 times [2020-07-01 13:00:55,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014836009] [2020-07-01 13:00:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014836009] [2020-07-01 13:00:55,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783029590] [2020-07-01 13:00:55,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,834 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 3 states. [2020-07-01 13:00:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:55,926 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2020-07-01 13:00:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:00:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:55,927 INFO L225 Difference]: With dead ends: 38 [2020-07-01 13:00:55,928 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:00:55,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:00:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:00:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:00:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-07-01 13:00:55,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 4 [2020-07-01 13:00:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:55,932 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-01 13:00:55,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2020-07-01 13:00:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:00:55,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:55,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:00:55,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:00:55,933 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash 152278145, now seen corresponding path program 1 times [2020-07-01 13:00:55,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:55,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940033513] [2020-07-01 13:00:55,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:55,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940033513] [2020-07-01 13:00:55,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:55,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:55,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450468340] [2020-07-01 13:00:55,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:55,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:55,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:55,968 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 3 states. [2020-07-01 13:00:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:56,028 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-07-01 13:00:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:56,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:00:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:56,029 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:00:56,029 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:00:56,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:00:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:00:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:00:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-01 13:00:56,032 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 5 [2020-07-01 13:00:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:56,033 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-01 13:00:56,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-07-01 13:00:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:00:56,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:00:56,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:00:56,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:00:56,034 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:00:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 152278143, now seen corresponding path program 1 times [2020-07-01 13:00:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:56,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933777639] [2020-07-01 13:00:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:56,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933777639] [2020-07-01 13:00:56,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:56,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:56,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794319650] [2020-07-01 13:00:56,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:00:56,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:56,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:56,072 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 3 states. [2020-07-01 13:00:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:56,118 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-07-01 13:00:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:56,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:00:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:00:56,119 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:00:56,119 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:00:56,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:00:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:00:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:00:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:00:56,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:00:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:00:56,120 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:00:56,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:00:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:00:56,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:00:56,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:00:56,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:00:56,157 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:00:56,158 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,158 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,158 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,158 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,158 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:00:56,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:00:56,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,161 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 24) no Hoare annotation was computed. [2020-07-01 13:00:56,162 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 24) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:00:56,162 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,162 INFO L268 CegarLoopResult]: For program point L17-4(lines 17 24) no Hoare annotation was computed. [2020-07-01 13:00:56,162 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,162 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,162 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,163 INFO L268 CegarLoopResult]: For program point L13-5(lines 13 16) no Hoare annotation was computed. [2020-07-01 13:00:56,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:00:56,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:00:56,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,164 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 22) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:00:56,165 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:00:56,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:00:56,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:00:56,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:00:56,169 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:00:56,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:56,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:56,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:56 BasicIcfg [2020-07-01 13:00:56,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:00:56,190 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:00:56,190 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:00:56,193 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:00:56,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:56,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:00:53" (1/5) ... [2020-07-01 13:00:56,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b2699f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:00:56, skipping insertion in model container [2020-07-01 13:00:56,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:56,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:00:53" (2/5) ... [2020-07-01 13:00:56,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b2699f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:00:56, skipping insertion in model container [2020-07-01 13:00:56,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:56,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:00:54" (3/5) ... [2020-07-01 13:00:56,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b2699f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:00:56, skipping insertion in model container [2020-07-01 13:00:56,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:56,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:00:54" (4/5) ... [2020-07-01 13:00:56,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8b2699f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:00:56, skipping insertion in model container [2020-07-01 13:00:56,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:00:56,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:00:56" (5/5) ... [2020-07-01 13:00:56,198 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:00:56,219 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:00:56,219 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:00:56,219 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:00:56,219 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:00:56,220 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:00:56,220 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:00:56,220 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:00:56,220 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:00:56,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2020-07-01 13:00:56,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 13:00:56,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:00:56,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:00:56,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:56,237 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:56,237 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:00:56,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2020-07-01 13:00:56,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 13:00:56,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:00:56,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:00:56,241 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:56,241 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:00:56,247 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [127] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [207] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_test_fun_#t~mem14=|v_ULTIMATE.start_test_fun_#t~mem14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_main_#t~ret17=|v_ULTIMATE.start_main_#t~ret17_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_test_fun_#t~mem14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret17, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 12#L10true [105] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 52#L10-1true [148] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 28#L11true [128] L11-->L12: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 43#L12true [139] L12-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 58#L13true [231] L13-->L13-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (> |v_ULTIMATE.start_test_fun_#t~mem3_3| 0)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 57#L13-1true [157] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 37#L13-5true [136] L13-5-->L17-3: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_9|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 61#L17-3true [2020-07-01 13:00:56,248 INFO L796 eck$LassoCheckResult]: Loop: 61#L17-3true [164] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 48#L17-1true [254] L17-1-->L18: Formula: (> 0 |v_ULTIMATE.start_test_fun_#t~mem8_6|) InVars {ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 8#L18true [100] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= 1 (select |v_#valid_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_27|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_21|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 7#L18-1true [97] L18-1-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem10_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 5#L18-2true [95] L18-2-->L19: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem10_4| |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem9] 25#L19true [124] L19-->L19-1: Formula: (and (= (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 23#L19-1true [292] L19-1-->L18-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_19) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_53| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= (store |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_27) v_ULTIMATE.start_test_fun_~x_ref~0.offset_19 |v_ULTIMATE.start_test_fun_#t~mem11_6|)) |v_#memory_int_26|)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_41|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 18#L18-4true [113] L18-4-->L23: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem13_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_2|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13] 45#L23true [294] L23-->L17-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_12) (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_16) v_ULTIMATE.start_test_fun_~c~0.offset_12 (+ |v_ULTIMATE.start_test_fun_#t~mem13_6| 1))) |v_#memory_int_30|) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~c~0.base_16)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_12 4) (select |v_#length_43| v_ULTIMATE.start_test_fun_~c~0.base_16))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_6|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_12, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_5|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem13, #memory_int] 61#L17-3true [2020-07-01 13:00:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 932821835, now seen corresponding path program 1 times [2020-07-01 13:00:56,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:56,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508638041] [2020-07-01 13:00:56,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:00:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:00:56,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508638041] [2020-07-01 13:00:56,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:00:56,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:00:56,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096454533] [2020-07-01 13:00:56,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:00:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:00:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1450687108, now seen corresponding path program 1 times [2020-07-01 13:00:56,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:00:56,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659439535] [2020-07-01 13:00:56,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:00:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:00:56,310 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:00:56,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:00:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:00:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:00:56,458 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-01 13:00:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:00:56,575 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2020-07-01 13:00:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:00:56,578 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:00:56,582 INFO L168 Benchmark]: Toolchain (without parser) took 2983.53 ms. Allocated memory was 649.6 MB in the beginning and 753.9 MB in the end (delta: 104.3 MB). Free memory was 561.5 MB in the beginning and 683.9 MB in the end (delta: -122.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:00:56,583 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 13:00:56,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.68 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 561.5 MB in the beginning and 648.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.18 ms. Allocated memory is still 686.8 MB. Free memory was 648.9 MB in the beginning and 646.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,585 INFO L168 Benchmark]: Boogie Preprocessor took 24.87 ms. Allocated memory is still 686.8 MB. Free memory was 646.2 MB in the beginning and 644.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,585 INFO L168 Benchmark]: RCFGBuilder took 464.31 ms. Allocated memory is still 686.8 MB. Free memory was 644.9 MB in the beginning and 613.3 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,586 INFO L168 Benchmark]: BlockEncodingV2 took 132.62 ms. Allocated memory is still 686.8 MB. Free memory was 613.3 MB in the beginning and 601.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,586 INFO L168 Benchmark]: TraceAbstraction took 1619.64 ms. Allocated memory is still 686.8 MB. Free memory was 599.9 MB in the beginning and 411.8 MB in the end (delta: 188.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:00:56,587 INFO L168 Benchmark]: BuchiAutomizer took 390.08 ms. Allocated memory was 686.8 MB in the beginning and 753.9 MB in the end (delta: 67.1 MB). Free memory was 411.8 MB in the beginning and 683.9 MB in the end (delta: -272.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:00:56,590 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 68 locations, 72 edges - StatisticsResult: Encoded RCFG 59 locations, 105 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 305.68 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 561.5 MB in the beginning and 648.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.18 ms. Allocated memory is still 686.8 MB. Free memory was 648.9 MB in the beginning and 646.2 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.87 ms. Allocated memory is still 686.8 MB. Free memory was 646.2 MB in the beginning and 644.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 464.31 ms. Allocated memory is still 686.8 MB. Free memory was 644.9 MB in the beginning and 613.3 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 132.62 ms. Allocated memory is still 686.8 MB. Free memory was 613.3 MB in the beginning and 601.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1619.64 ms. Allocated memory is still 686.8 MB. Free memory was 599.9 MB in the beginning and 411.8 MB in the end (delta: 188.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 390.08 ms. Allocated memory was 686.8 MB in the beginning and 753.9 MB in the end (delta: 67.1 MB). Free memory was 411.8 MB in the beginning and 683.9 MB in the end (delta: -272.2 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: 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: 23]: 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: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 13:00:56,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:56,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:00:56,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:00:56,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 34 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 76 SDtfs, 465 SDslu, 4 SDs, 0 SdLazy, 413 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:00:50.315 ----------------------------------------------- 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_wxFzay/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:00:56.828 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check