./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 429b7772bb057004ca0c11ab7cd7751d4a0d846f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:57:56,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:56,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:56,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:56,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:56,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:56,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:56,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:56,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:56,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:56,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:56,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:56,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:56,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:56,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:56,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:56,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:56,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:56,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:56,631 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:56,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:56,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:56,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:56,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:56,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:56,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:56,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:56,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:56,642 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:56,643 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:56,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:56,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:56,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:56,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:56,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:56,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:56,647 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:57:56,673 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:56,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:56,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:56,676 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:56,676 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:56,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:56,676 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:56,676 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:56,677 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:56,678 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:56,678 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:56,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:56,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:56,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:56,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:56,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:56,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:56,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:56,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:56,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:56,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:56,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:56,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2019-01-14 14:57:56,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:56,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:56,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:56,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:56,744 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:56,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2019-01-14 14:57:56,802 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee0a9947/2a4c1b949cf3469f90ae9e9cfccdf437/FLAG397770413 [2019-01-14 14:57:57,289 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:57,290 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2019-01-14 14:57:57,311 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee0a9947/2a4c1b949cf3469f90ae9e9cfccdf437/FLAG397770413 [2019-01-14 14:57:57,576 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee0a9947/2a4c1b949cf3469f90ae9e9cfccdf437 [2019-01-14 14:57:57,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:57,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:57,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:57,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:57,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:57,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:57" (1/1) ... [2019-01-14 14:57:57,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cfb557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:57, skipping insertion in model container [2019-01-14 14:57:57,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:57" (1/1) ... [2019-01-14 14:57:57,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:57,644 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:58,002 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:58,011 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:58,112 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:58,127 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:58,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58 WrapperNode [2019-01-14 14:57:58,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:58,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:58,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:58,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:58,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:58,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:58,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:58,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:58,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... [2019-01-14 14:57:58,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:58,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:58,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:58,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:58,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:58,527 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:59,512 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 14:57:59,512 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 14:57:59,514 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:59,514 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:59,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:59 BoogieIcfgContainer [2019-01-14 14:57:59,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:59,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:59,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:59,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:59,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:57" (1/3) ... [2019-01-14 14:57:59,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289fe616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:59, skipping insertion in model container [2019-01-14 14:57:59,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:58" (2/3) ... [2019-01-14 14:57:59,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289fe616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:59, skipping insertion in model container [2019-01-14 14:57:59,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:59" (3/3) ... [2019-01-14 14:57:59,526 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2019-01-14 14:57:59,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:59,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:59,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:59,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:59,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:59,596 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:59,596 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:59,596 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:59,596 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:59,596 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:59,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:59,597 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-01-14 14:57:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:57:59,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:59,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:59,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:59,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:59,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-01-14 14:57:59,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:59,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:59,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:59,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:59,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:59,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:59,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:59,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:59,866 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-01-14 14:58:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:00,222 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-01-14 14:58:00,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:00,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:58:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:00,238 INFO L225 Difference]: With dead ends: 251 [2019-01-14 14:58:00,238 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 14:58:00,242 INFO L631 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 [2019-01-14 14:58:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 14:58:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 14:58:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 14:58:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-01-14 14:58:00,288 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-01-14 14:58:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:00,289 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-01-14 14:58:00,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-01-14 14:58:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 14:58:00,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:00,292 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:00,292 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-01-14 14:58:00,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:00,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:00,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:00,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:00,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:00,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:00,407 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-01-14 14:58:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:00,926 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-01-14 14:58:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:00,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-14 14:58:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:00,932 INFO L225 Difference]: With dead ends: 237 [2019-01-14 14:58:00,934 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 14:58:00,937 INFO L631 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 [2019-01-14 14:58:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 14:58:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-01-14 14:58:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 14:58:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-01-14 14:58:00,962 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-01-14 14:58:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:00,963 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-01-14 14:58:00,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-01-14 14:58:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 14:58:00,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:00,965 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:00,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-01-14 14:58:00,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:00,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:00,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 14:58:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:01,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:01,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:01,078 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-01-14 14:58:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:01,324 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-01-14 14:58:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:01,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-14 14:58:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:01,331 INFO L225 Difference]: With dead ends: 271 [2019-01-14 14:58:01,331 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 14:58:01,332 INFO L631 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 [2019-01-14 14:58:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 14:58:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-01-14 14:58:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 14:58:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-01-14 14:58:01,344 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-01-14 14:58:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:01,345 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-01-14 14:58:01,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-01-14 14:58:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:58:01,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:01,348 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:01,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:01,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-01-14 14:58:01,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:58:01,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:01,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:01,454 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-01-14 14:58:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:01,801 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-01-14 14:58:01,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:01,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:58:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:01,805 INFO L225 Difference]: With dead ends: 334 [2019-01-14 14:58:01,805 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:58:01,806 INFO L631 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 [2019-01-14 14:58:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:58:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-01-14 14:58:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 14:58:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-01-14 14:58:01,821 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-01-14 14:58:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:01,821 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-01-14 14:58:01,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-01-14 14:58:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-14 14:58:01,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:01,826 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:01,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-01-14 14:58:01,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 14:58:01,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:01,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:01,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:01,983 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-01-14 14:58:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:02,213 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-01-14 14:58:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:02,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-14 14:58:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:02,217 INFO L225 Difference]: With dead ends: 389 [2019-01-14 14:58:02,217 INFO L226 Difference]: Without dead ends: 211 [2019-01-14 14:58:02,218 INFO L631 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 [2019-01-14 14:58:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-14 14:58:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-01-14 14:58:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-14 14:58:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-01-14 14:58:02,232 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-01-14 14:58:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:02,233 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-01-14 14:58:02,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-01-14 14:58:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:02,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:02,238 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:02,238 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-01-14 14:58:02,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-14 14:58:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:02,369 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-01-14 14:58:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:02,539 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-01-14 14:58:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:02,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:02,542 INFO L225 Difference]: With dead ends: 427 [2019-01-14 14:58:02,542 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 14:58:02,543 INFO L631 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 [2019-01-14 14:58:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 14:58:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-14 14:58:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-14 14:58:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-01-14 14:58:02,552 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-01-14 14:58:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:02,553 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-01-14 14:58:02,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-01-14 14:58:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:58:02,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:02,555 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:02,556 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-01-14 14:58:02,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 14:58:02,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:02,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:02,702 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-01-14 14:58:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:02,867 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-01-14 14:58:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:02,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:58:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:02,875 INFO L225 Difference]: With dead ends: 661 [2019-01-14 14:58:02,880 INFO L226 Difference]: Without dead ends: 443 [2019-01-14 14:58:02,881 INFO L631 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 [2019-01-14 14:58:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-01-14 14:58:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-01-14 14:58:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-14 14:58:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-01-14 14:58:02,920 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-01-14 14:58:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:02,921 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-01-14 14:58:02,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-01-14 14:58:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 14:58:02,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:02,930 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:02,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-01-14 14:58:02,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-14 14:58:03,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:03,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:03,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:03,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:03,095 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-01-14 14:58:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:03,336 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-01-14 14:58:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:03,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-14 14:58:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:03,342 INFO L225 Difference]: With dead ends: 661 [2019-01-14 14:58:03,342 INFO L226 Difference]: Without dead ends: 659 [2019-01-14 14:58:03,343 INFO L631 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 [2019-01-14 14:58:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-01-14 14:58:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-01-14 14:58:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-14 14:58:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-01-14 14:58:03,367 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-01-14 14:58:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:03,368 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-01-14 14:58:03,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-01-14 14:58:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-14 14:58:03,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:03,373 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:03,373 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-01-14 14:58:03,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:03,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:03,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:03,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:03,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-01-14 14:58:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:03,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:03,501 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-01-14 14:58:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:04,897 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-01-14 14:58:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:04,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-01-14 14:58:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:04,902 INFO L225 Difference]: With dead ends: 1462 [2019-01-14 14:58:04,902 INFO L226 Difference]: Without dead ends: 809 [2019-01-14 14:58:04,903 INFO L631 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 [2019-01-14 14:58:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-01-14 14:58:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-01-14 14:58:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-14 14:58:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-01-14 14:58:04,925 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-01-14 14:58:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:04,926 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-01-14 14:58:04,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-01-14 14:58:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-14 14:58:04,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:04,931 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:04,931 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-01-14 14:58:04,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:04,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:04,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-14 14:58:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:05,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:05,059 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-01-14 14:58:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:05,615 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-01-14 14:58:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:05,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-01-14 14:58:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:05,622 INFO L225 Difference]: With dead ends: 1824 [2019-01-14 14:58:05,623 INFO L226 Difference]: Without dead ends: 1006 [2019-01-14 14:58:05,625 INFO L631 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 [2019-01-14 14:58:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-01-14 14:58:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-01-14 14:58:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-01-14 14:58:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-01-14 14:58:05,656 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-01-14 14:58:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:05,657 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-01-14 14:58:05,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-01-14 14:58:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-14 14:58:05,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:05,666 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:05,666 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:05,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-01-14 14:58:05,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:05,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-01-14 14:58:05,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:05,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:05,790 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-01-14 14:58:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:06,266 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-01-14 14:58:06,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:06,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-01-14 14:58:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:06,273 INFO L225 Difference]: With dead ends: 2080 [2019-01-14 14:58:06,274 INFO L226 Difference]: Without dead ends: 1079 [2019-01-14 14:58:06,275 INFO L631 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 [2019-01-14 14:58:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-01-14 14:58:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-01-14 14:58:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-01-14 14:58:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-01-14 14:58:06,302 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-01-14 14:58:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:06,302 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-01-14 14:58:06,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-01-14 14:58:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-14 14:58:06,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:06,308 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:06,308 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-01-14 14:58:06,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:06,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:06,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-01-14 14:58:06,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:06,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:06,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:06,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:06,441 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-01-14 14:58:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:06,752 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-01-14 14:58:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:06,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-14 14:58:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:06,762 INFO L225 Difference]: With dead ends: 2230 [2019-01-14 14:58:06,762 INFO L226 Difference]: Without dead ends: 1160 [2019-01-14 14:58:06,764 INFO L631 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 [2019-01-14 14:58:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-01-14 14:58:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-01-14 14:58:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-01-14 14:58:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-01-14 14:58:06,796 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-01-14 14:58:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:06,797 INFO L480 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-01-14 14:58:06,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-01-14 14:58:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-14 14:58:06,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:06,803 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:06,803 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-01-14 14:58:06,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:06,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:06,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:06,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-01-14 14:58:06,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:06,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:06,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:06,941 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-01-14 14:58:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:07,898 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-01-14 14:58:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:07,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-14 14:58:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:07,907 INFO L225 Difference]: With dead ends: 2398 [2019-01-14 14:58:07,908 INFO L226 Difference]: Without dead ends: 1256 [2019-01-14 14:58:07,910 INFO L631 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 [2019-01-14 14:58:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-01-14 14:58:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-01-14 14:58:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-01-14 14:58:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-01-14 14:58:07,944 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-01-14 14:58:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:07,944 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-01-14 14:58:07,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-01-14 14:58:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-14 14:58:07,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:07,951 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:07,952 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-01-14 14:58:07,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:07,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-01-14 14:58:08,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:08,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:08,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:08,105 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-01-14 14:58:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:08,226 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-01-14 14:58:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:08,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-14 14:58:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:08,238 INFO L225 Difference]: With dead ends: 3630 [2019-01-14 14:58:08,239 INFO L226 Difference]: Without dead ends: 2422 [2019-01-14 14:58:08,242 INFO L631 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 [2019-01-14 14:58:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-01-14 14:58:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-01-14 14:58:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-14 14:58:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-01-14 14:58:08,302 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-01-14 14:58:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:08,304 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-01-14 14:58:08,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-01-14 14:58:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-14 14:58:08,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:08,312 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:08,312 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-01-14 14:58:08,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:08,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:08,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:08,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-01-14 14:58:08,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:08,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:08,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:08,393 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-01-14 14:58:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:08,923 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-01-14 14:58:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:08,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-14 14:58:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:08,939 INFO L225 Difference]: With dead ends: 5143 [2019-01-14 14:58:08,939 INFO L226 Difference]: Without dead ends: 2702 [2019-01-14 14:58:08,944 INFO L631 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 [2019-01-14 14:58:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-01-14 14:58:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-01-14 14:58:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-01-14 14:58:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-01-14 14:58:09,021 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-01-14 14:58:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:09,022 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-01-14 14:58:09,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-01-14 14:58:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-14 14:58:09,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:09,034 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:09,035 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-01-14 14:58:09,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:09,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-01-14 14:58:09,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:09,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:09,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:09,214 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-01-14 14:58:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:10,088 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-01-14 14:58:10,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:10,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-01-14 14:58:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:10,102 INFO L225 Difference]: With dead ends: 5335 [2019-01-14 14:58:10,102 INFO L226 Difference]: Without dead ends: 2696 [2019-01-14 14:58:10,106 INFO L631 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 [2019-01-14 14:58:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-01-14 14:58:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-01-14 14:58:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-01-14 14:58:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-01-14 14:58:10,166 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-01-14 14:58:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:10,167 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-01-14 14:58:10,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-01-14 14:58:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-01-14 14:58:10,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:10,174 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:10,174 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-01-14 14:58:10,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:10,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:10,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-01-14 14:58:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:10,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:10,326 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-01-14 14:58:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:10,988 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-01-14 14:58:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:10,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-01-14 14:58:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:11,002 INFO L225 Difference]: With dead ends: 5299 [2019-01-14 14:58:11,002 INFO L226 Difference]: Without dead ends: 2684 [2019-01-14 14:58:11,007 INFO L631 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 [2019-01-14 14:58:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-01-14 14:58:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-01-14 14:58:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-01-14 14:58:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-01-14 14:58:11,068 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-01-14 14:58:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:11,068 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-01-14 14:58:11,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-01-14 14:58:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-14 14:58:11,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:11,076 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:11,076 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-01-14 14:58:11,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:11,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:11,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:11,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-01-14 14:58:11,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:11,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:11,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:11,263 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-01-14 14:58:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:11,562 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-01-14 14:58:11,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:11,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-01-14 14:58:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:11,577 INFO L225 Difference]: With dead ends: 5545 [2019-01-14 14:58:11,577 INFO L226 Difference]: Without dead ends: 2930 [2019-01-14 14:58:11,581 INFO L631 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 [2019-01-14 14:58:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-01-14 14:58:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-01-14 14:58:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-01-14 14:58:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-01-14 14:58:11,650 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-01-14 14:58:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:11,651 INFO L480 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-01-14 14:58:11,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-01-14 14:58:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-14 14:58:11,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:11,660 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:11,660 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-01-14 14:58:11,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:11,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-01-14 14:58:11,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:11,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:11,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:11,885 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-01-14 14:58:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:12,090 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-01-14 14:58:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:12,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-01-14 14:58:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:12,119 INFO L225 Difference]: With dead ends: 7734 [2019-01-14 14:58:12,125 INFO L226 Difference]: Without dead ends: 5029 [2019-01-14 14:58:12,131 INFO L631 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 [2019-01-14 14:58:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-01-14 14:58:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-01-14 14:58:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-01-14 14:58:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-01-14 14:58:12,243 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-01-14 14:58:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:12,244 INFO L480 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-01-14 14:58:12,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-01-14 14:58:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-14 14:58:12,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:12,252 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:12,252 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-01-14 14:58:12,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:12,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-01-14 14:58:12,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:12,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:12,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-01-14 14:58:13,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:58:13,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:58:13,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:58:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:58:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:58:13,076 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-01-14 14:58:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:16,548 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-01-14 14:58:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:58:16,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-01-14 14:58:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:16,579 INFO L225 Difference]: With dead ends: 9987 [2019-01-14 14:58:16,579 INFO L226 Difference]: Without dead ends: 7540 [2019-01-14 14:58:16,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-01-14 14:58:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-01-14 14:58:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-01-14 14:58:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-01-14 14:58:16,738 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-01-14 14:58:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-01-14 14:58:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:58:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-01-14 14:58:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-01-14 14:58:16,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:16,751 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:16,751 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:16,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-01-14 14:58:16,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:16,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:16,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:16,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:16,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-01-14 14:58:17,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:17,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:17,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:17,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-01-14 14:58:17,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:58:17,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:58:17,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:58:17,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:58:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:58:17,334 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-01-14 14:58:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:19,764 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-01-14 14:58:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 14:58:19,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-01-14 14:58:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:19,785 INFO L225 Difference]: With dead ends: 12544 [2019-01-14 14:58:19,786 INFO L226 Difference]: Without dead ends: 6979 [2019-01-14 14:58:19,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-01-14 14:58:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-01-14 14:58:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-01-14 14:58:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-01-14 14:58:19,916 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-01-14 14:58:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:19,918 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-01-14 14:58:19,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:58:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-01-14 14:58:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-01-14 14:58:19,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:19,926 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:19,927 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-01-14 14:58:19,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:19,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-01-14 14:58:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:20,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:20,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:20,120 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-01-14 14:58:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:20,402 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-01-14 14:58:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:20,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-01-14 14:58:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:20,410 INFO L225 Difference]: With dead ends: 11015 [2019-01-14 14:58:20,410 INFO L226 Difference]: Without dead ends: 3069 [2019-01-14 14:58:20,419 INFO L631 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 [2019-01-14 14:58:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-01-14 14:58:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-01-14 14:58:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-01-14 14:58:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-01-14 14:58:20,487 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-01-14 14:58:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:20,487 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-01-14 14:58:20,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-01-14 14:58:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-01-14 14:58:20,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:20,495 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:20,495 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-01-14 14:58:20,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:20,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-01-14 14:58:20,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:20,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:20,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:21,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-01-14 14:58:21,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:21,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:21,285 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 5 states. [2019-01-14 14:58:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:21,546 INFO L93 Difference]: Finished difference Result 3603 states and 4841 transitions. [2019-01-14 14:58:21,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:58:21,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 496 [2019-01-14 14:58:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:21,547 INFO L225 Difference]: With dead ends: 3603 [2019-01-14 14:58:21,547 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:58:21,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:58:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:58:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:58:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:58:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:58:21,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 496 [2019-01-14 14:58:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:21,552 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:58:21,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:58:21,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:58:21,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:58:21,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,968 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 103 [2019-01-14 14:58:21,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:21,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:22,535 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2019-01-14 14:58:22,863 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2019-01-14 14:58:23,032 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2019-01-14 14:58:23,621 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-01-14 14:58:24,022 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 7 [2019-01-14 14:58:24,179 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2019-01-14 14:58:24,255 INFO L451 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-01-14 14:58:24,255 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-01-14 14:58:24,255 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-01-14 14:58:24,255 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-01-14 14:58:24,256 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-01-14 14:58:24,256 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-01-14 14:58:24,256 INFO L444 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-01-14 14:58:24,256 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-01-14 14:58:24,256 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-01-14 14:58:24,257 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-01-14 14:58:24,258 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-01-14 14:58:24,258 INFO L444 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-01-14 14:58:24,259 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L451 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-01-14 14:58:24,260 INFO L444 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L451 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-01-14 14:58:24,260 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-01-14 14:58:24,261 INFO L451 ceAbstractionStarter]: At program point L574(lines 11 576) the Hoare annotation is: true [2019-01-14 14:58:24,261 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-01-14 14:58:24,261 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-01-14 14:58:24,261 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2019-01-14 14:58:24,261 INFO L444 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2019-01-14 14:58:24,261 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-01-14 14:58:24,261 INFO L444 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse5 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (= ULTIMATE.start_ssl3_connect_~s__state~0 4400)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse3 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse1 (not (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse6 .cse7) (and .cse4 .cse8 .cse7 .cse5) (and .cse9 .cse10 .cse11 .cse7 .cse12) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse8 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4368) .cse0) (and .cse13 .cse0 .cse7) (and .cse13 .cse8 .cse7 .cse12) (and .cse2 .cse3 .cse11 .cse7 .cse12) (and .cse1 .cse9 .cse10 .cse0) (and .cse6 .cse12))) [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L444 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: false [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L444 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-01-14 14:58:24,262 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L444 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-01-14 14:58:24,263 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-01-14 14:58:24,264 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L444 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L451 ceAbstractionStarter]: At program point L585(lines 577 587) the Hoare annotation is: true [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-01-14 14:58:24,265 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1))) [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-01-14 14:58:24,266 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L444 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-01-14 14:58:24,267 INFO L448 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1) .cse2) (and .cse2 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (and .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-01-14 14:58:24,268 INFO L444 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-01-14 14:58:24,268 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-01-14 14:58:24,269 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-01-14 14:58:24,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:58:24 BoogieIcfgContainer [2019-01-14 14:58:24,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:58:24,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:58:24,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:58:24,309 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:58:24,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:59" (3/4) ... [2019-01-14 14:58:24,322 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:58:24,349 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 14:58:24,350 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:58:24,488 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:58:24,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:58:24,492 INFO L168 Benchmark]: Toolchain (without parser) took 26908.74 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 674.2 MB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -481.8 MB). Peak memory consumption was 192.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,493 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:58:24,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.19 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,494 INFO L168 Benchmark]: Boogie Preprocessor took 58.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:58:24,494 INFO L168 Benchmark]: RCFGBuilder took 1174.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,494 INFO L168 Benchmark]: TraceAbstraction took 24792.21 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 533.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -374.6 MB). Peak memory consumption was 683.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,497 INFO L168 Benchmark]: Witness Printer took 178.93 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:24,500 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 546.19 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 153.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1174.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24792.21 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 533.2 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -374.6 MB). Peak memory consumption was 683.5 MB. Max. memory is 11.5 GB. * Witness Printer took 178.93 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && s__state <= 4448) && 4432 <= s__state) || (((blastFlag <= 4 && s__state <= 4448) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((s__state <= 4528 && blastFlag <= 2) && 4432 <= s__state)) || ((blastFlag <= 2 && s__state <= 3) && s__hit == 0)) || (((s__state <= 4528 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (s__state == 4384 && blastFlag <= 2)) || (s__state == 4368 && blastFlag <= 2)) || ((s__state == 4400 && blastFlag <= 2) && s__hit == 0)) || (((s__state == 4400 && blastFlag <= 4) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560)) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((s__state <= 4464 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) || ((s__state <= 4464 && blastFlag <= 2) && 4432 <= s__state) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4480 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && !(0 == s__hit)) && s__state <= 4352) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 2) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 4) && s__hit == 0) && 4432 <= s__state) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__hit == 0) && 4432 <= s__state) && s__state <= 4560) || (((s__state <= 4560 && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((s__state <= 4560 && blastFlag <= 2) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. SAFE Result, 24.6s OverallTime, 23 OverallIterations, 19 TraceHistogramMax, 15.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4190 SDtfs, 2033 SDslu, 2326 SDs, 0 SdLazy, 2384 SolverSat, 589 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1291 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 3979 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 178 NumberOfFragments, 481 HoareAnnotationTreeSize, 22 FomulaSimplifications, 19605 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 13737 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 6205 NumberOfCodeBlocks, 6205 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6179 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949423 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 24243/24291 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...