/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:04:36,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:04:36,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:04:36,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:04:36,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:04:36,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:04:36,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:04:36,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:04:36,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:04:36,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:04:36,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:04:36,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:04:36,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:04:36,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:04:36,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:04:36,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:04:36,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:04:36,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:04:36,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:04:36,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:04:36,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:04:36,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:04:36,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:04:36,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:04:36,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:04:36,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:04:36,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:04:36,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:04:36,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:04:36,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:04:36,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:04:36,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:04:36,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:04:36,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:04:36,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:04:36,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:04:36,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:04:36,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:04:36,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:04:36,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:04:36,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:04:36,584 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:04:36,598 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:04:36,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:04:36,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:04:36,600 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:04:36,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:04:36,600 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:04:36,600 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:04:36,600 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:04:36,601 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:04:36,602 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:04:36,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:04:36,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:04:36,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:04:36,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:04:36,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:04:36,603 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:04:36,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:04:36,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:04:36,603 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:04:36,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:04:36,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:04:36,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:04:36,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:04:36,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:04:36,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:04:36,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:04:36,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:04:36,786 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:04:36,786 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:04:36,787 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:04:36,860 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_UWjfQW/tmp/56e5c7ab0dc14f779a3078d0086a3cfd/FLAG0057dfe51 [2020-07-01 13:04:37,190 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:04:37,191 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:04:37,191 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:04:37,198 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_UWjfQW/tmp/56e5c7ab0dc14f779a3078d0086a3cfd/FLAG0057dfe51 [2020-07-01 13:04:37,601 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_UWjfQW/tmp/56e5c7ab0dc14f779a3078d0086a3cfd [2020-07-01 13:04:37,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:04:37,614 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:04:37,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:04:37,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:04:37,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:04:37,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d078f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37, skipping insertion in model container [2020-07-01 13:04:37,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:04:37,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:04:37,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:04:37,896 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:04:37,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:04:37,930 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:04:37,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37 WrapperNode [2020-07-01 13:04:37,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:04:37,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:04:37,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:04:37,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:04:37,941 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:04:37" (1/1) ... [2020-07-01 13:04:37,950 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:04:37" (1/1) ... [2020-07-01 13:04:37,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:04:37,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:04:37,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:04:37,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:04:37,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (1/1) ... [2020-07-01 13:04:37,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:04:37,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:04:37,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:04:37,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:04:38,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (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:04:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:04:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:04:38,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:04:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:04:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:04:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:04:38,428 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:04:38,428 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:04:38,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38 BoogieIcfgContainer [2020-07-01 13:04:38,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:04:38,433 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:04:38,433 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:04:38,435 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:04:38,436 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (1/1) ... [2020-07-01 13:04:38,452 INFO L313 BlockEncoder]: Initial Icfg 68 locations, 71 edges [2020-07-01 13:04:38,454 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:04:38,454 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:04:38,455 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:04:38,455 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:04:38,457 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:04:38,458 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:04:38,458 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:04:38,487 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:04:38,526 INFO L200 BlockEncoder]: SBE split 38 edges [2020-07-01 13:04:38,531 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:04:38,532 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:04:38,572 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 13:04:38,575 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:04:38,576 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:04:38,577 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:04:38,577 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:04:38,578 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:04:38,578 INFO L313 BlockEncoder]: Encoded RCFG 59 locations, 105 edges [2020-07-01 13:04:38,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38 BasicIcfg [2020-07-01 13:04:38,579 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:04:38,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:04:38,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:04:38,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:04:38,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:04:37" (1/4) ... [2020-07-01 13:04:38,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2ba42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (2/4) ... [2020-07-01 13:04:38,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2ba42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (3/4) ... [2020-07-01 13:04:38,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2ba42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:38, skipping insertion in model container [2020-07-01 13:04:38,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38" (4/4) ... [2020-07-01 13:04:38,588 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:04:38,598 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:04:38,606 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2020-07-01 13:04:38,620 INFO L251 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2020-07-01 13:04:38,643 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:04:38,643 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:04:38,643 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:04:38,643 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:04:38,644 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:04:38,644 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:04:38,644 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:04:38,644 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:04:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-01 13:04:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:04:38,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:38,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:04:38,667 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash 147924, now seen corresponding path program 1 times [2020-07-01 13:04:38,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:38,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817248994] [2020-07-01 13:04:38,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:38,837 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:04:38,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817248994] [2020-07-01 13:04:38,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:38,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:38,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515268689] [2020-07-01 13:04:38,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:38,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:38,863 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-01 13:04:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,045 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2020-07-01 13:04:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:04:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,059 INFO L225 Difference]: With dead ends: 116 [2020-07-01 13:04:39,060 INFO L226 Difference]: Without dead ends: 59 [2020-07-01 13:04:39,063 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:04:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-01 13:04:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-01 13:04:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-01 13:04:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 98 transitions. [2020-07-01 13:04:39,103 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 98 transitions. Word has length 3 [2020-07-01 13:04:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,103 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 98 transitions. [2020-07-01 13:04:39,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 98 transitions. [2020-07-01 13:04:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:04:39,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:04:39,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:04:39,106 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 147769, now seen corresponding path program 1 times [2020-07-01 13:04:39,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645983724] [2020-07-01 13:04:39,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,162 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:04:39,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645983724] [2020-07-01 13:04:39,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266050211] [2020-07-01 13:04:39,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,165 INFO L87 Difference]: Start difference. First operand 59 states and 98 transitions. Second operand 3 states. [2020-07-01 13:04:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,329 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2020-07-01 13:04:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:04:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,331 INFO L225 Difference]: With dead ends: 59 [2020-07-01 13:04:39,331 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:04:39,332 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:04:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:04:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:04:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:04:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2020-07-01 13:04:39,339 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 3 [2020-07-01 13:04:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,339 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2020-07-01 13:04:39,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2020-07-01 13:04:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:04:39,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:04:39,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:04:39,340 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 147771, now seen corresponding path program 1 times [2020-07-01 13:04:39,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872604494] [2020-07-01 13:04:39,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,368 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:04:39,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872604494] [2020-07-01 13:04:39,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142979340] [2020-07-01 13:04:39,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,370 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand 3 states. [2020-07-01 13:04:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,475 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2020-07-01 13:04:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:04:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,477 INFO L225 Difference]: With dead ends: 59 [2020-07-01 13:04:39,477 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:04:39,478 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:04:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:04:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 13:04:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 13:04:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2020-07-01 13:04:39,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 3 [2020-07-01 13:04:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,484 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2020-07-01 13:04:39,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2020-07-01 13:04:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:04:39,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:04:39,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:04:39,485 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 147772, now seen corresponding path program 1 times [2020-07-01 13:04:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915509810] [2020-07-01 13:04:39,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,525 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:04:39,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915509810] [2020-07-01 13:04:39,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326174940] [2020-07-01 13:04:39,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,528 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand 3 states. [2020-07-01 13:04:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,658 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2020-07-01 13:04:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:04:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,659 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:04:39,660 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:04:39,660 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:04:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:04:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 13:04:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:04:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-07-01 13:04:39,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 3 [2020-07-01 13:04:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,666 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-07-01 13:04:39,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-07-01 13:04:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:04:39,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:04:39,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:04:39,667 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash 4577642, now seen corresponding path program 1 times [2020-07-01 13:04:39,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032308379] [2020-07-01 13:04:39,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,705 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:04:39,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032308379] [2020-07-01 13:04:39,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624208856] [2020-07-01 13:04:39,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,708 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 3 states. [2020-07-01 13:04:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,796 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-07-01 13:04:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:04:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,798 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:04:39,798 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 13:04:39,798 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:04:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 13:04:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 13:04:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:04:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-07-01 13:04:39,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 4 [2020-07-01 13:04:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,803 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-07-01 13:04:39,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-07-01 13:04:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:04:39,803 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:04:39,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:04:39,804 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 4577644, now seen corresponding path program 1 times [2020-07-01 13:04:39,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117594568] [2020-07-01 13:04:39,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,851 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:04:39,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117594568] [2020-07-01 13:04:39,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091523404] [2020-07-01 13:04:39,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,854 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 3 states. [2020-07-01 13:04:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:39,923 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-01 13:04:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:39,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:04:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:39,925 INFO L225 Difference]: With dead ends: 37 [2020-07-01 13:04:39,925 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:04:39,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:04:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:04:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:04:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-01 13:04:39,930 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 4 [2020-07-01 13:04:39,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:39,930 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-01 13:04:39,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-01 13:04:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:04:39,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:39,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:39,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:04:39,931 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 141905042, now seen corresponding path program 1 times [2020-07-01 13:04:39,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:39,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252950890] [2020-07-01 13:04:39,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:39,968 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:04:39,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252950890] [2020-07-01 13:04:39,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:39,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:39,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334894272] [2020-07-01 13:04:39,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:39,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:39,970 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 3 states. [2020-07-01 13:04:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:40,022 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2020-07-01 13:04:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:40,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:04:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:40,024 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:04:40,024 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:04:40,024 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:04:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:04:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:04:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:04:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-01 13:04:40,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 5 [2020-07-01 13:04:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:40,029 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-01 13:04:40,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-01 13:04:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:04:40,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:40,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:40,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:04:40,030 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.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_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:04:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 141905044, now seen corresponding path program 1 times [2020-07-01 13:04:40,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:40,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516233062] [2020-07-01 13:04:40,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:40,069 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:04:40,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516233062] [2020-07-01 13:04:40,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:40,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:40,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072997251] [2020-07-01 13:04:40,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:04:40,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:40,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:40,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:40,071 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 3 states. [2020-07-01 13:04:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:40,120 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-01 13:04:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:40,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:04:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:40,121 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:04:40,121 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:04:40,122 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:04:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:04:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:04:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:04:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:04:40,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:04:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:40,123 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:04:40,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:04:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:04:40,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:04:40,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:04:40,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:04:40,158 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:04:40,158 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,159 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,159 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:04:40,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:04:40,159 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,160 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:04:40,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point L17-2(lines 17 21) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:04:40,162 INFO L268 CegarLoopResult]: For program point L17-4(lines 14 22) no Hoare annotation was computed. [2020-07-01 13:04:40,163 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 24) no Hoare annotation was computed. [2020-07-01 13:04:40,163 INFO L264 CegarLoopResult]: At program point L13-3(lines 12 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:04:40,163 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 24) no Hoare annotation was computed. [2020-07-01 13:04:40,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:04:40,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:04:40,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:04:40,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:04:40,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,164 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,165 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point L14-2(lines 14 22) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:04:40,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:40,169 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:04:40,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:04:40,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:04:40,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:40 BasicIcfg [2020-07-01 13:04:40,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:04:40,190 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:04:40,190 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:04:40,194 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:04:40,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:04:37" (1/5) ... [2020-07-01 13:04:40,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6913cf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:04:37" (2/5) ... [2020-07-01 13:04:40,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6913cf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:04:38" (3/5) ... [2020-07-01 13:04:40,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6913cf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:04:38" (4/5) ... [2020-07-01 13:04:40,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6913cf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:40, skipping insertion in model container [2020-07-01 13:04:40,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:40,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:40" (5/5) ... [2020-07-01 13:04:40,199 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:04:40,220 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:04:40,220 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:04:40,220 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:04:40,220 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:04:40,220 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:04:40,221 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:04:40,221 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:04:40,221 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:04:40,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2020-07-01 13:04:40,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 13:04:40,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:40,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:40,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:40,237 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:40,238 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:04:40,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2020-07-01 13:04:40,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-07-01 13:04:40,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:40,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:40,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:40,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:40,247 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [116] 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] 9#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 (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~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_#in~y_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_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_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_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_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_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [99] 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] 54#L10-1true [146] 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] 27#L11true [117] L11-->L13-3: 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] 56#L13-3true [2020-07-01 13:04:40,248 INFO L796 eck$LassoCheckResult]: Loop: 56#L13-3true [150] L13-3-->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] 59#L13true [155] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 58#L13-1true [154] L13-1-->L14: Formula: (< 0 (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, 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] 18#L14true [109] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 17#L14-1true [104] L14-1-->L14-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 14#L14-2true [102] L14-2-->L15: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 20#L15true [113] L15-->L15-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~mem7_2|) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) 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_21|} OutVars{#valid=|v_#valid_21|, #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, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 30#L15-1true [287] L15-1-->L17-4: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~x_ref~0.base_27 (store (select |v_#memory_int_31| 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~mem7_6| (- 1)))) |v_#memory_int_30|) (<= 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_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_27)) (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~x_ref~0.base_27))) InVars {#valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_55|, #memory_int=|v_#memory_int_30|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_19, #length=|v_#length_45|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 60#L17-4true [158] L17-4-->L23: Formula: (and (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem12_2|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_37| 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_22|, #length=|v_#length_35|, 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_37|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 44#L23true [288] L23-->L13-3: Formula: (and (= (select |v_#valid_56| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_46| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_32| (store |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_33| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_33|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 56#L13-3true [2020-07-01 13:04:40,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 142024106, now seen corresponding path program 1 times [2020-07-01 13:04:40,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:40,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019411663] [2020-07-01 13:04:40,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:40,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:04:40,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019411663] [2020-07-01 13:04:40,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:40,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:40,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273671331] [2020-07-01 13:04:40,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:04:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash 941977319, now seen corresponding path program 1 times [2020-07-01 13:04:40,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:40,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570683031] [2020-07-01 13:04:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:40,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:04:40,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:40,478 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2020-07-01 13:04:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:40,593 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2020-07-01 13:04:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:40,596 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:04:40,601 INFO L168 Benchmark]: Toolchain (without parser) took 2985.92 ms. Allocated memory was 649.6 MB in the beginning and 755.5 MB in the end (delta: 105.9 MB). Free memory was 556.3 MB in the beginning and 681.7 MB in the end (delta: -125.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:40,601 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 578.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:40,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 556.3 MB in the beginning and 653.1 MB in the end (delta: -96.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:40,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 691.0 MB. Free memory was 653.1 MB in the beginning and 650.4 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:04:40,603 INFO L168 Benchmark]: Boogie Preprocessor took 25.15 ms. Allocated memory is still 691.0 MB. Free memory was 650.4 MB in the beginning and 649.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:40,603 INFO L168 Benchmark]: RCFGBuilder took 433.89 ms. Allocated memory is still 691.0 MB. Free memory was 649.0 MB in the beginning and 618.5 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:40,604 INFO L168 Benchmark]: BlockEncodingV2 took 146.02 ms. Allocated memory is still 691.0 MB. Free memory was 618.5 MB in the beginning and 605.0 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:40,604 INFO L168 Benchmark]: TraceAbstraction took 1609.74 ms. Allocated memory is still 691.0 MB. Free memory was 605.0 MB in the beginning and 414.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 190.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:40,605 INFO L168 Benchmark]: BuchiAutomizer took 407.84 ms. Allocated memory was 691.0 MB in the beginning and 755.5 MB in the end (delta: 64.5 MB). Free memory was 414.1 MB in the beginning and 681.7 MB in the end (delta: -267.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:40,608 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 68 locations, 71 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 578.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 315.85 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 556.3 MB in the beginning and 653.1 MB in the end (delta: -96.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 691.0 MB. Free memory was 653.1 MB in the beginning and 650.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.15 ms. Allocated memory is still 691.0 MB. Free memory was 650.4 MB in the beginning and 649.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 433.89 ms. Allocated memory is still 691.0 MB. Free memory was 649.0 MB in the beginning and 618.5 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 146.02 ms. Allocated memory is still 691.0 MB. Free memory was 618.5 MB in the beginning and 605.0 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1609.74 ms. Allocated memory is still 691.0 MB. Free memory was 605.0 MB in the beginning and 414.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 190.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 407.84 ms. Allocated memory was 691.0 MB in the beginning and 755.5 MB in the end (delta: 64.5 MB). Free memory was 414.1 MB in the beginning and 681.7 MB in the end (delta: -267.5 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: 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 18]: 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: 20]: 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: 20]: 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: 20]: 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: 20]: 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: 14]: 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: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:04:40,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:04:40,619 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,620 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,620 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:40,621 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:04:40,621 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, 36 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: 58 SDtfs, 455 SDslu, 4 SDs, 0 SdLazy, 421 SolverSat, 71 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.0s 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:04:34.376 ----------------------------------------------- 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_UWjfQW/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:04:40.845 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check