/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 11:22:38,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:22:38,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:22:38,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:22:38,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:22:38,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:22:38,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:22:38,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:22:38,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:22:38,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:22:38,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:22:38,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:22:38,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:22:38,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:22:38,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:22:38,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:22:38,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:22:38,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:22:38,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:22:38,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:22:38,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:22:38,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:22:38,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:22:38,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:22:38,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:22:38,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:22:38,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:22:38,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:22:38,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:22:38,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:22:38,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:22:38,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:22:38,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:22:38,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:22:38,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:22:38,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:22:38,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:22:38,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:22:38,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:22:38,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:22:38,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:22:38,441 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:22:38,456 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:22:38,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:22:38,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:22:38,457 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:22:38,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:22:38,457 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:22:38,458 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:22:38,458 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:22:38,458 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:22:38,458 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:22:38,458 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:22:38,458 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:22:38,459 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:22:38,459 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:22:38,459 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:22:38,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:22:38,459 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:22:38,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:22:38,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:22:38,460 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:22:38,460 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:22:38,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:22:38,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:22:38,461 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:22:38,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:22:38,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:22:38,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:22:38,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:22:38,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:22:38,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:22:38,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:22:38,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:22:38,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:22:38,647 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:22:38,648 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:22:38,713 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HI2d4R/tmp/350e9122b00d436f84aedc65aadb2256/FLAGd9a40540a [2020-07-01 11:22:39,066 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:22:39,067 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:22:39,067 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 11:22:39,075 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_HI2d4R/tmp/350e9122b00d436f84aedc65aadb2256/FLAGd9a40540a [2020-07-01 11:22:39,475 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_HI2d4R/tmp/350e9122b00d436f84aedc65aadb2256 [2020-07-01 11:22:39,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:22:39,487 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:22:39,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:22:39,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:22:39,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:22:39,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c9f46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39, skipping insertion in model container [2020-07-01 11:22:39,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:22:39,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:22:39,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:22:39,756 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:22:39,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:22:39,789 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:22:39,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39 WrapperNode [2020-07-01 11:22:39,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:22:39,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:22:39,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:22:39,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:22:39,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:22:39,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:22:39,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:22:39,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:22:39,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... [2020-07-01 11:22:39,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:22:39,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:22:39,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:22:39,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:22:39,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:22:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:22:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 11:22:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:22:39,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:22:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:22:40,166 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:22:40,166 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 11:22:40,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:22:40 BoogieIcfgContainer [2020-07-01 11:22:40,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:22:40,171 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:22:40,171 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:22:40,173 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:22:40,173 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:22:40" (1/1) ... [2020-07-01 11:22:40,187 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 32 edges [2020-07-01 11:22:40,188 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:22:40,189 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:22:40,189 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:22:40,190 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:22:40,192 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:22:40,192 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:22:40,193 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:22:40,214 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:22:40,244 INFO L200 BlockEncoder]: SBE split 12 edges [2020-07-01 11:22:40,251 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:22:40,253 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:22:40,277 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 11:22:40,280 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 11:22:40,282 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:22:40,282 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:22:40,282 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:22:40,283 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:22:40,283 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges [2020-07-01 11:22:40,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:22:40 BasicIcfg [2020-07-01 11:22:40,284 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:22:40,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:22:40,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:22:40,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:22:40,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:22:39" (1/4) ... [2020-07-01 11:22:40,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1618b0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:22:40, skipping insertion in model container [2020-07-01 11:22:40,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (2/4) ... [2020-07-01 11:22:40,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1618b0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:22:40, skipping insertion in model container [2020-07-01 11:22:40,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:22:40" (3/4) ... [2020-07-01 11:22:40,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1618b0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:22:40, skipping insertion in model container [2020-07-01 11:22:40,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:22:40" (4/4) ... [2020-07-01 11:22:40,292 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:22:40,303 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:22:40,310 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 11:22:40,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 11:22:40,347 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:22:40,347 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:22:40,348 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:22:40,348 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:22:40,348 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:22:40,348 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:22:40,348 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:22:40,348 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:22:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-01 11:22:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:22:40,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:40,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:22:40,370 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 5063892, now seen corresponding path program 1 times [2020-07-01 11:22:40,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:40,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478441518] [2020-07-01 11:22:40,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:40,546 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 11:22:40,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478441518] [2020-07-01 11:22:40,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:40,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:22:40,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908451354] [2020-07-01 11:22:40,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:22:40,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:40,572 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-01 11:22:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:40,684 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. [2020-07-01 11:22:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:40,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:22:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:40,699 INFO L225 Difference]: With dead ends: 32 [2020-07-01 11:22:40,699 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 11:22:40,703 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 11:22:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 11:22:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 11:22:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 11:22:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2020-07-01 11:22:40,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 [2020-07-01 11:22:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:40,740 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2020-07-01 11:22:40,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:22:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2020-07-01 11:22:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:22:40,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:40,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:22:40,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:22:40,743 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash 5063894, now seen corresponding path program 1 times [2020-07-01 11:22:40,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:40,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091699305] [2020-07-01 11:22:40,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:40,776 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 11:22:40,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091699305] [2020-07-01 11:22:40,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:40,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:22:40,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95732692] [2020-07-01 11:22:40,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:22:40,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:40,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:40,780 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 3 states. [2020-07-01 11:22:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:40,848 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2020-07-01 11:22:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:40,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:22:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:40,850 INFO L225 Difference]: With dead ends: 19 [2020-07-01 11:22:40,850 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 11:22:40,851 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 11:22:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 11:22:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 11:22:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 11:22:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2020-07-01 11:22:40,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 [2020-07-01 11:22:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:40,856 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2020-07-01 11:22:40,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:22:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2020-07-01 11:22:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:22:40,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:40,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:22:40,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:22:40,857 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash 5063895, now seen corresponding path program 1 times [2020-07-01 11:22:40,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:40,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868643858] [2020-07-01 11:22:40,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:40,888 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 11:22:40,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868643858] [2020-07-01 11:22:40,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:40,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:22:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660469697] [2020-07-01 11:22:40,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:22:40,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:22:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:22:40,890 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2020-07-01 11:22:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:40,955 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. [2020-07-01 11:22:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:22:40,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:22:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:40,956 INFO L225 Difference]: With dead ends: 18 [2020-07-01 11:22:40,956 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 11:22:40,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:22:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 11:22:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 11:22:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 11:22:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2020-07-01 11:22:40,960 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 [2020-07-01 11:22:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:40,961 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-07-01 11:22:40,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:22:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. [2020-07-01 11:22:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:22:40,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:40,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:22:40,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:22:40,962 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 156981814, now seen corresponding path program 1 times [2020-07-01 11:22:40,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:40,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139032673] [2020-07-01 11:22:40,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:40,992 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 11:22:40,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139032673] [2020-07-01 11:22:40,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:40,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:22:40,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718802993] [2020-07-01 11:22:40,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:22:40,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:40,994 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. [2020-07-01 11:22:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:41,045 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. [2020-07-01 11:22:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:41,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 11:22:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:41,047 INFO L225 Difference]: With dead ends: 17 [2020-07-01 11:22:41,047 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 11:22:41,048 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 11:22:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 11:22:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 11:22:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 11:22:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2020-07-01 11:22:41,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 [2020-07-01 11:22:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:41,051 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2020-07-01 11:22:41,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:22:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2020-07-01 11:22:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:22:41,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:41,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:22:41,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:22:41,053 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 156981816, now seen corresponding path program 1 times [2020-07-01 11:22:41,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:41,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941232613] [2020-07-01 11:22:41,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:41,115 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 11:22:41,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941232613] [2020-07-01 11:22:41,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:41,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:22:41,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558670428] [2020-07-01 11:22:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:22:41,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:22:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:22:41,118 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 5 states. [2020-07-01 11:22:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:41,226 INFO L93 Difference]: Finished difference Result 24 states and 54 transitions. [2020-07-01 11:22:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:22:41,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-07-01 11:22:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:41,228 INFO L225 Difference]: With dead ends: 24 [2020-07-01 11:22:41,228 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 11:22:41,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:22:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 11:22:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 11:22:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 11:22:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-07-01 11:22:41,234 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 [2020-07-01 11:22:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:41,234 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-07-01 11:22:41,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:22:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2020-07-01 11:22:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 11:22:41,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:41,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:22:41,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:22:41,235 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash -648955393, now seen corresponding path program 1 times [2020-07-01 11:22:41,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:41,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013762466] [2020-07-01 11:22:41,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:41,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013762466] [2020-07-01 11:22:41,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:41,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:22:41,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031779211] [2020-07-01 11:22:41,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:22:41,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:41,283 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. [2020-07-01 11:22:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:41,355 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. [2020-07-01 11:22:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:41,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 11:22:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:41,357 INFO L225 Difference]: With dead ends: 35 [2020-07-01 11:22:41,357 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 11:22:41,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:22:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 11:22:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-01 11:22:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 11:22:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2020-07-01 11:22:41,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 [2020-07-01 11:22:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:41,363 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. [2020-07-01 11:22:41,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:22:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2020-07-01 11:22:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 11:22:41,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:41,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:22:41,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 11:22:41,364 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:41,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -648895811, now seen corresponding path program 1 times [2020-07-01 11:22:41,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:41,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943095365] [2020-07-01 11:22:41,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:41,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943095365] [2020-07-01 11:22:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:41,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:22:41,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580987257] [2020-07-01 11:22:41,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:22:41,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:41,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:41,394 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. [2020-07-01 11:22:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:41,462 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. [2020-07-01 11:22:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:41,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 11:22:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:41,464 INFO L225 Difference]: With dead ends: 37 [2020-07-01 11:22:41,464 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 11:22:41,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:22:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 11:22:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 11:22:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 11:22:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2020-07-01 11:22:41,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 [2020-07-01 11:22:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:41,469 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. [2020-07-01 11:22:41,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:22:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. [2020-07-01 11:22:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:22:41,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:41,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:22:41,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:22:41,470 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash -877373307, now seen corresponding path program 1 times [2020-07-01 11:22:41,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:41,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876678276] [2020-07-01 11:22:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:41,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876678276] [2020-07-01 11:22:41,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897193006] [2020-07-01 11:22:41,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:41,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-01 11:22:41,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:22:41,721 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:22:41,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:22:41,768 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:41,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:22:41,787 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:41,807 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:41,811 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:22:41,811 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 11:22:41,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:41,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 11:22:41,867 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:41,868 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:22:41,880 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:41,881 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:22:41,884 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:22:41,884 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:27 [2020-07-01 11:22:41,919 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:41,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:22:41,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-01 11:22:41,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560665075] [2020-07-01 11:22:41,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 11:22:41,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:41,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 11:22:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:22:41,942 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 11 states. [2020-07-01 11:22:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:42,454 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-07-01 11:22:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 11:22:42,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-07-01 11:22:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:42,456 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:22:42,456 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 11:22:42,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:22:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 11:22:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-07-01 11:22:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 11:22:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2020-07-01 11:22:42,461 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 11 [2020-07-01 11:22:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:42,462 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 43 transitions. [2020-07-01 11:22:42,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 11:22:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 43 transitions. [2020-07-01 11:22:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:22:42,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:42,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:22:42,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 11:22:42,664 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:42,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash -877373306, now seen corresponding path program 1 times [2020-07-01 11:22:42,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:42,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137389652] [2020-07-01 11:22:42,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:42,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137389652] [2020-07-01 11:22:42,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368297971] [2020-07-01 11:22:42,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:42,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:22:42,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:22:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:42,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:22:42,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 11:22:42,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622883653] [2020-07-01 11:22:42,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:22:42,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:22:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:22:42,758 INFO L87 Difference]: Start difference. First operand 23 states and 43 transitions. Second operand 4 states. [2020-07-01 11:22:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:42,823 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2020-07-01 11:22:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:22:42,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 11:22:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:42,824 INFO L225 Difference]: With dead ends: 24 [2020-07-01 11:22:42,824 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 11:22:42,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:22:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 11:22:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 11:22:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 11:22:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-07-01 11:22:42,828 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 [2020-07-01 11:22:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:42,828 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-07-01 11:22:42,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:22:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2020-07-01 11:22:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 11:22:42,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:42,829 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-01 11:22:43,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:43,030 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1005147886, now seen corresponding path program 2 times [2020-07-01 11:22:43,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:43,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252004203] [2020-07-01 11:22:43,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:22:43,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252004203] [2020-07-01 11:22:43,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783516280] [2020-07-01 11:22:43,215 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:43,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:22:43,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:22:43,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 11:22:43,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:22:43,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:22:43,264 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:43,268 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:43,268 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:22:43,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:22:43,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:22:43,287 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:43,292 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:43,293 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:22:43,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 11:22:43,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:43,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 11:22:43,346 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:43,347 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:22:43,359 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:43,360 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:22:43,362 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:22:43,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 11:22:43,393 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:22:43,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:22:43,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-01 11:22:43,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236289287] [2020-07-01 11:22:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 11:22:43,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 11:22:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:22:43,415 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 12 states. [2020-07-01 11:22:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:43,973 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-07-01 11:22:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 11:22:43,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-01 11:22:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:43,975 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:22:43,975 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 11:22:43,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-07-01 11:22:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 11:22:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-07-01 11:22:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 11:22:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2020-07-01 11:22:43,980 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 [2020-07-01 11:22:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:43,981 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. [2020-07-01 11:22:43,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 11:22:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. [2020-07-01 11:22:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 11:22:43,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:22:43,982 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:22:44,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 11:22:44,182 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:22:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2113899394, now seen corresponding path program 1 times [2020-07-01 11:22:44,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:44,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005402134] [2020-07-01 11:22:44,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-01 11:22:44,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005402134] [2020-07-01 11:22:44,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871443253] [2020-07-01 11:22:44,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:44,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 11:22:44,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:22:44,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:22:44,359 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:44,364 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:44,364 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:22:44,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:22:44,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:22:44,370 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:22:44,372 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:44,372 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:22:44,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:22:44,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:44,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 11:22:44,390 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:44,391 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:22:44,399 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:22:44,399 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:22:44,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 11:22:44,423 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:22:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 11:22:44,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:22:44,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-01 11:22:44,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350261393] [2020-07-01 11:22:44,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 11:22:44,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:22:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:22:44,438 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 9 states. [2020-07-01 11:22:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:44,528 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. [2020-07-01 11:22:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:22:44,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-01 11:22:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:22:44,529 INFO L225 Difference]: With dead ends: 24 [2020-07-01 11:22:44,529 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:22:44,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:22:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:22:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:22:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:22:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:22:44,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-01 11:22:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:22:44,531 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:22:44,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 11:22:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:22:44,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:22:44,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:22:44,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:22:44,898 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-07-01 11:22:44,921 INFO L268 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,921 INFO L268 CegarLoopResult]: For program point L29-2(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,921 INFO L268 CegarLoopResult]: For program point L29-3(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,921 INFO L268 CegarLoopResult]: For program point L29-4(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,922 INFO L268 CegarLoopResult]: For program point L29-6(lines 29 30) no Hoare annotation was computed. [2020-07-01 11:22:44,922 INFO L264 CegarLoopResult]: At program point L29-8(lines 29 30) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse1 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse2 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse4 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrchr_~s.base) (- 1)))) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)))) (.cse3 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) (or (and (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= 1 ULTIMATE.start_cstrchr_~s.offset) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ULTIMATE.start_cstrchr_~s.offset) .cse0 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 1) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= ULTIMATE.start_cstrchr_~s.offset ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)))) .cse1 .cse2 .cse4 .cse3 .cse5))) [2020-07-01 11:22:44,922 INFO L268 CegarLoopResult]: For program point L29-9(lines 29 30) no Hoare annotation was computed. [2020-07-01 11:22:44,922 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:22:44,923 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,924 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 11:22:44,924 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:22:44,926 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:22:44,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:44,952 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:44,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:44,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:22:44 BasicIcfg [2020-07-01 11:22:44,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:22:44,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:22:44,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:22:44,963 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:22:44,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:22:44,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:22:39" (1/5) ... [2020-07-01 11:22:44,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36c00c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:22:44, skipping insertion in model container [2020-07-01 11:22:44,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:22:44,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:22:39" (2/5) ... [2020-07-01 11:22:44,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36c00c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:22:44, skipping insertion in model container [2020-07-01 11:22:44,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:22:44,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:22:40" (3/5) ... [2020-07-01 11:22:44,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36c00c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:22:44, skipping insertion in model container [2020-07-01 11:22:44,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:22:44,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:22:40" (4/5) ... [2020-07-01 11:22:44,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36c00c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:22:44, skipping insertion in model container [2020-07-01 11:22:44,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:22:44,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:22:44" (5/5) ... [2020-07-01 11:22:44,967 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:22:44,989 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:22:44,989 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:22:44,989 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:22:44,989 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:22:44,990 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:22:44,990 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:22:44,990 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:22:44,990 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:22:44,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 11:22:44,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 11:22:44,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:22:44,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:22:45,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:22:45,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:22:45,003 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:22:45,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 11:22:45,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 11:22:45,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:22:45,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:22:45,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:22:45,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 11:22:45,010 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 19#L12true [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 14#L12-2true [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| |v_#StackHeapBarrier_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 5#L16true [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 15#L29-8true [2020-07-01 11:22:45,011 INFO L796 eck$LassoCheckResult]: Loop: 15#L29-8true [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3)) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 8#L29-1true [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 6#L29-2true [65] L29-2-->L29-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short4_5|) InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} AuxVars[] AssignedVars[] 20#L29-6true [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 15#L29-8true [2020-07-01 11:22:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 1 times [2020-07-01 11:22:45,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:45,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985277765] [2020-07-01 11:22:45,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:22:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:22:45,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:22:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:22:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 3182042, now seen corresponding path program 1 times [2020-07-01 11:22:45,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:22:45,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429941877] [2020-07-01 11:22:45,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:22:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:22:45,053 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 11:22:45,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429941877] [2020-07-01 11:22:45,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:22:45,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:22:45,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357797006] [2020-07-01 11:22:45,054 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:22:45,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:22:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:22:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:22:45,056 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-01 11:22:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:22:45,123 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. [2020-07-01 11:22:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:22:45,126 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 11:22:45,130 INFO L168 Benchmark]: Toolchain (without parser) took 5642.51 ms. Allocated memory was 514.9 MB in the beginning and 634.4 MB in the end (delta: 119.5 MB). Free memory was 438.6 MB in the beginning and 465.8 MB in the end (delta: -27.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,130 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:22:45,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.94 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 437.9 MB in the beginning and 525.0 MB in the end (delta: -87.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 558.4 MB. Free memory was 525.0 MB in the beginning and 523.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,131 INFO L168 Benchmark]: Boogie Preprocessor took 25.84 ms. Allocated memory is still 558.4 MB. Free memory was 523.0 MB in the beginning and 521.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,132 INFO L168 Benchmark]: RCFGBuilder took 313.64 ms. Allocated memory is still 558.4 MB. Free memory was 521.0 MB in the beginning and 501.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,132 INFO L168 Benchmark]: BlockEncodingV2 took 113.22 ms. Allocated memory is still 558.4 MB. Free memory was 501.0 MB in the beginning and 492.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,133 INFO L168 Benchmark]: TraceAbstraction took 4673.75 ms. Allocated memory was 558.4 MB in the beginning and 634.4 MB in the end (delta: 76.0 MB). Free memory was 491.6 MB in the beginning and 489.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 77.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,133 INFO L168 Benchmark]: BuchiAutomizer took 169.06 ms. Allocated memory is still 634.4 MB. Free memory was 489.9 MB in the beginning and 465.8 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 50.3 GB. [2020-07-01 11:22:45,136 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 32 edges - StatisticsResult: Encoded RCFG 19 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 300.94 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 437.9 MB in the beginning and 525.0 MB in the end (delta: -87.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 558.4 MB. Free memory was 525.0 MB in the beginning and 523.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.84 ms. Allocated memory is still 558.4 MB. Free memory was 523.0 MB in the beginning and 521.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * RCFGBuilder took 313.64 ms. Allocated memory is still 558.4 MB. Free memory was 521.0 MB in the beginning and 501.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 113.22 ms. Allocated memory is still 558.4 MB. Free memory was 501.0 MB in the beginning and 492.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4673.75 ms. Allocated memory was 558.4 MB in the beginning and 634.4 MB in the end (delta: 76.0 MB). Free memory was 491.6 MB in the beginning and 489.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 77.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 169.06 ms. Allocated memory is still 634.4 MB. Free memory was 489.9 MB in the beginning and 465.8 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] * 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2020-07-01 11:22:45,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:22:45,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:22:45,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((s + 1 <= unknown-#length-unknown[s] && 1 <= s) && nondetString == 0) && 1 == \valid[s]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && 1 <= length) || (((((((0 == s && nondetString == 0) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + 1 <= unknown-#length-unknown[s] && s <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset])) && 1 == \valid[s]) && unknown-#length-unknown[nondetString] == length) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1]) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && 1 == \valid[nondetString]) && 1 <= length) - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:22:45,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:22:45,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((nondetString == 0 && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 SDtfs, 731 SDslu, 224 SDs, 0 SdLazy, 623 SolverSat, 71 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 134 HoareAnnotationTreeSize, 2 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 73 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 149 ConstructedInterpolants, 8 QuantifiedInterpolants, 19003 SizeOfPredicates, 32 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 18/64 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 11:22:36.242 ----------------------------------------------- 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_HI2d4R/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:22:45.380 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check