./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_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_2_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 1236ee922960b2737aa65707c3f9d27b28eaa4fc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11 21:23:08,634 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:08,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:08,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:08,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:08,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:08,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:08,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:08,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:08,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:08,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:08,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:08,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:08,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:08,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:08,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:08,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:08,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:08,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:08,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:08,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:08,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:08,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:08,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:08,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:08,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:08,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:08,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:08,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:08,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:08,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:08,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:08,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:08,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:08,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:08,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:08,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:23:08,696 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:08,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:08,698 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:08,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:08,698 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:08,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:08,699 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:08,700 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:08,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:08,701 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:08,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:08,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:08,701 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:08,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:08,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:08,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:08,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:08,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:08,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:08,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:08,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:08,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:08,704 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 -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2019-01-11 21:23:08,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:08,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:08,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:08,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:08,761 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:08,762 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:08,828 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8ffb159/43754b9032cb43c38cb42a230f6c8012/FLAG493a2fa93 [2019-01-11 21:23:09,270 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:09,272 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:09,281 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8ffb159/43754b9032cb43c38cb42a230f6c8012/FLAG493a2fa93 [2019-01-11 21:23:09,606 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8ffb159/43754b9032cb43c38cb42a230f6c8012 [2019-01-11 21:23:09,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:09,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:09,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:09,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:09,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:09,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:09" (1/1) ... [2019-01-11 21:23:09,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a50080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:09, skipping insertion in model container [2019-01-11 21:23:09,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:09" (1/1) ... [2019-01-11 21:23:09,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:09,687 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:09,967 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:09,971 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:10,038 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:10,055 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:10,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10 WrapperNode [2019-01-11 21:23:10,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:10,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:10,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:10,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:10,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:10,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:10,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:10,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:10,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (1/1) ... [2019-01-11 21:23:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:10,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:10,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:10,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:10,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (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-11 21:23:10,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:10,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:10,430 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:11,444 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-11 21:23:11,444 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-11 21:23:11,445 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:11,445 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:23:11,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:11 BoogieIcfgContainer [2019-01-11 21:23:11,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:11,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:11,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:11,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:11,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:09" (1/3) ... [2019-01-11 21:23:11,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652cc435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:11, skipping insertion in model container [2019-01-11 21:23:11,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:10" (2/3) ... [2019-01-11 21:23:11,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652cc435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:11, skipping insertion in model container [2019-01-11 21:23:11,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:11" (3/3) ... [2019-01-11 21:23:11,453 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2019-01-11 21:23:11,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:11,468 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:11,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:11,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:11,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:11,515 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:11,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:11,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:11,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:11,516 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:11,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:11,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-01-11 21:23:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:23:11,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:11,543 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-11 21:23:11,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-01-11 21:23:11,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:11,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:11,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:11,754 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-11 21:23:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:11,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:11,778 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-01-11 21:23:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:12,134 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-01-11 21:23:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:12,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:23:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:12,156 INFO L225 Difference]: With dead ends: 251 [2019-01-11 21:23:12,157 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 21:23:12,161 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-11 21:23:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 21:23:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-11 21:23:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 21:23:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-01-11 21:23:12,217 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-01-11 21:23:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:12,217 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-01-11 21:23:12,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-01-11 21:23:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 21:23:12,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:12,223 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-11 21:23:12,223 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-01-11 21:23:12,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:12,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:12,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:12,400 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-11 21:23:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:12,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:12,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:12,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:12,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:12,404 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-01-11 21:23:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:13,007 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-01-11 21:23:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-11 21:23:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:13,009 INFO L225 Difference]: With dead ends: 238 [2019-01-11 21:23:13,009 INFO L226 Difference]: Without dead ends: 133 [2019-01-11 21:23:13,011 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-11 21:23:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-11 21:23:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-01-11 21:23:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-11 21:23:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-01-11 21:23:13,024 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-01-11 21:23:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:13,024 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-01-11 21:23:13,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-01-11 21:23:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 21:23:13,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:13,027 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-11 21:23:13,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-01-11 21:23:13,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:13,162 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-11 21:23:13,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:13,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:13,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:13,165 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-01-11 21:23:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:13,392 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-01-11 21:23:13,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:13,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-11 21:23:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:13,397 INFO L225 Difference]: With dead ends: 270 [2019-01-11 21:23:13,397 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 21:23:13,398 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-11 21:23:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 21:23:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-01-11 21:23:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-11 21:23:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-01-11 21:23:13,410 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-01-11 21:23:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:13,410 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-01-11 21:23:13,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-01-11 21:23:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:23:13,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:13,413 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-11 21:23:13,413 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-01-11 21:23:13,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:13,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:13,538 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-11 21:23:13,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:13,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:13,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:13,540 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-01-11 21:23:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:13,893 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-01-11 21:23:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:13,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:23:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:13,897 INFO L225 Difference]: With dead ends: 334 [2019-01-11 21:23:13,897 INFO L226 Difference]: Without dead ends: 196 [2019-01-11 21:23:13,898 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-11 21:23:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-11 21:23:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-01-11 21:23:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 21:23:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-01-11 21:23:13,911 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-01-11 21:23:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:13,911 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-01-11 21:23:13,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-01-11 21:23:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 21:23:13,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:13,914 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-11 21:23:13,914 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-01-11 21:23:13,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:14,009 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-11 21:23:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:14,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:14,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:14,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:14,011 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-01-11 21:23:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:14,225 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-01-11 21:23:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-11 21:23:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:14,229 INFO L225 Difference]: With dead ends: 389 [2019-01-11 21:23:14,229 INFO L226 Difference]: Without dead ends: 211 [2019-01-11 21:23:14,230 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-11 21:23:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-11 21:23:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-01-11 21:23:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 21:23:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-01-11 21:23:14,241 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-01-11 21:23:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:14,245 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-01-11 21:23:14,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-01-11 21:23:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:14,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:14,249 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-11 21:23:14,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-01-11 21:23:14,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:14,362 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-11 21:23:14,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:14,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:14,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:14,366 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-01-11 21:23:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:14,604 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-01-11 21:23:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:14,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:14,607 INFO L225 Difference]: With dead ends: 427 [2019-01-11 21:23:14,607 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 21:23:14,608 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-11 21:23:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 21:23:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-11 21:23:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 21:23:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-01-11 21:23:14,617 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-01-11 21:23:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:14,617 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-01-11 21:23:14,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-01-11 21:23:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:23:14,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:14,620 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-11 21:23:14,620 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-01-11 21:23:14,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:14,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:14,733 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-11 21:23:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:14,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:14,736 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-01-11 21:23:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:14,842 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-01-11 21:23:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:14,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:23:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:14,857 INFO L225 Difference]: With dead ends: 661 [2019-01-11 21:23:14,857 INFO L226 Difference]: Without dead ends: 443 [2019-01-11 21:23:14,858 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-11 21:23:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-01-11 21:23:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-01-11 21:23:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-11 21:23:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-01-11 21:23:14,892 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-01-11 21:23:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:14,892 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-01-11 21:23:14,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-01-11 21:23:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:23:14,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:14,899 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-11 21:23:14,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-01-11 21:23:14,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:14,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:14,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:15,029 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-11 21:23:15,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:15,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:15,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:15,033 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-01-11 21:23:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:15,346 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-01-11 21:23:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:15,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:23:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:15,354 INFO L225 Difference]: With dead ends: 661 [2019-01-11 21:23:15,354 INFO L226 Difference]: Without dead ends: 659 [2019-01-11 21:23:15,355 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-11 21:23:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-01-11 21:23:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-01-11 21:23:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-11 21:23:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-01-11 21:23:15,382 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-01-11 21:23:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:15,385 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-01-11 21:23:15,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-01-11 21:23:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 21:23:15,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:15,389 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 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-11 21:23:15,389 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash -365763014, now seen corresponding path program 1 times [2019-01-11 21:23:15,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:15,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-01-11 21:23:15,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:15,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:15,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:15,509 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-01-11 21:23:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:16,457 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-01-11 21:23:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:16,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-01-11 21:23:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:16,462 INFO L225 Difference]: With dead ends: 1462 [2019-01-11 21:23:16,463 INFO L226 Difference]: Without dead ends: 809 [2019-01-11 21:23:16,464 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-11 21:23:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-01-11 21:23:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-01-11 21:23:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-11 21:23:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-01-11 21:23:16,489 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 175 [2019-01-11 21:23:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:16,489 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-01-11 21:23:16,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-01-11 21:23:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-11 21:23:16,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:16,492 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-11 21:23:16,493 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1933345798, now seen corresponding path program 2 times [2019-01-11 21:23:16,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:16,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:16,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:16,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:16,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:16,604 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-11 21:23:16,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:16,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:16,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:16,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:16,606 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-01-11 21:23:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:17,141 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-01-11 21:23:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:17,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-01-11 21:23:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:17,147 INFO L225 Difference]: With dead ends: 1824 [2019-01-11 21:23:17,148 INFO L226 Difference]: Without dead ends: 1006 [2019-01-11 21:23:17,150 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-11 21:23:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-01-11 21:23:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-01-11 21:23:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-01-11 21:23:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-01-11 21:23:17,183 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-01-11 21:23:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:17,183 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-01-11 21:23:17,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-01-11 21:23:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-11 21:23:17,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:17,187 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-11 21:23:17,187 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1781023665, now seen corresponding path program 1 times [2019-01-11 21:23:17,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:17,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:23:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:17,300 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-11 21:23:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:17,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:17,302 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-01-11 21:23:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:17,796 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-01-11 21:23:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:17,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-01-11 21:23:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:17,802 INFO L225 Difference]: With dead ends: 2080 [2019-01-11 21:23:17,802 INFO L226 Difference]: Without dead ends: 1079 [2019-01-11 21:23:17,804 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-11 21:23:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-01-11 21:23:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-01-11 21:23:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-01-11 21:23:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-01-11 21:23:17,830 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-01-11 21:23:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:17,830 INFO L480 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-01-11 21:23:17,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-01-11 21:23:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-11 21:23:17,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:17,834 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-11 21:23:17,835 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1647744508, now seen corresponding path program 1 times [2019-01-11 21:23:17,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:17,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:17,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:17,966 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-11 21:23:17,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:17,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:17,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:17,967 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-01-11 21:23:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:18,241 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-01-11 21:23:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:18,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-11 21:23:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:18,250 INFO L225 Difference]: With dead ends: 2230 [2019-01-11 21:23:18,251 INFO L226 Difference]: Without dead ends: 1160 [2019-01-11 21:23:18,253 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-11 21:23:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-01-11 21:23:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-01-11 21:23:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-01-11 21:23:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-01-11 21:23:18,282 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-01-11 21:23:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:18,282 INFO L480 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-01-11 21:23:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-01-11 21:23:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-11 21:23:18,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:18,288 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-11 21:23:18,288 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1766185982, now seen corresponding path program 1 times [2019-01-11 21:23:18,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:18,413 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-11 21:23:18,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:18,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:18,414 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-01-11 21:23:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:19,397 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-01-11 21:23:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:19,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-01-11 21:23:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:19,405 INFO L225 Difference]: With dead ends: 2398 [2019-01-11 21:23:19,406 INFO L226 Difference]: Without dead ends: 1256 [2019-01-11 21:23:19,408 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-11 21:23:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-01-11 21:23:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-01-11 21:23:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-01-11 21:23:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-01-11 21:23:19,438 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-01-11 21:23:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:19,438 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-01-11 21:23:19,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-01-11 21:23:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-11 21:23:19,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:19,445 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-11 21:23:19,445 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1276246012, now seen corresponding path program 1 times [2019-01-11 21:23:19,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:19,565 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-11 21:23:19,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:19,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:19,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:19,566 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-01-11 21:23:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:19,650 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-01-11 21:23:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:19,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-11 21:23:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:19,662 INFO L225 Difference]: With dead ends: 3630 [2019-01-11 21:23:19,662 INFO L226 Difference]: Without dead ends: 2422 [2019-01-11 21:23:19,665 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-11 21:23:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-01-11 21:23:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-01-11 21:23:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-01-11 21:23:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-01-11 21:23:19,722 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-01-11 21:23:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:19,723 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-01-11 21:23:19,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-01-11 21:23:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-11 21:23:19,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:19,731 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-11 21:23:19,731 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:19,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:19,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1394687486, now seen corresponding path program 1 times [2019-01-11 21:23:19,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:19,834 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-11 21:23:19,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:19,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:19,836 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-01-11 21:23:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:20,269 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-01-11 21:23:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:20,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-11 21:23:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:20,284 INFO L225 Difference]: With dead ends: 5143 [2019-01-11 21:23:20,284 INFO L226 Difference]: Without dead ends: 2702 [2019-01-11 21:23:20,289 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-11 21:23:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-01-11 21:23:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-01-11 21:23:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-01-11 21:23:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-01-11 21:23:20,372 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-01-11 21:23:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:20,372 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-01-11 21:23:20,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-01-11 21:23:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-11 21:23:20,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:20,379 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-11 21:23:20,379 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -777084420, now seen corresponding path program 1 times [2019-01-11 21:23:20,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:20,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:20,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:20,566 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-11 21:23:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:20,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:20,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:20,568 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-01-11 21:23:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:21,344 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-01-11 21:23:21,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:21,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-01-11 21:23:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:21,361 INFO L225 Difference]: With dead ends: 5335 [2019-01-11 21:23:21,361 INFO L226 Difference]: Without dead ends: 2696 [2019-01-11 21:23:21,365 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-11 21:23:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-01-11 21:23:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-01-11 21:23:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-01-11 21:23:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-01-11 21:23:21,429 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-01-11 21:23:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:21,429 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-01-11 21:23:21,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-01-11 21:23:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-11 21:23:21,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:21,435 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:23:21,436 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash -844895981, now seen corresponding path program 1 times [2019-01-11 21:23:21,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:21,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:21,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:21,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-01-11 21:23:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:21,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:21,596 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-01-11 21:23:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:22,076 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-01-11 21:23:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:22,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-11 21:23:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:22,090 INFO L225 Difference]: With dead ends: 5299 [2019-01-11 21:23:22,090 INFO L226 Difference]: Without dead ends: 2684 [2019-01-11 21:23:22,094 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-11 21:23:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-01-11 21:23:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-01-11 21:23:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-01-11 21:23:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-01-11 21:23:22,162 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 321 [2019-01-11 21:23:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:22,163 INFO L480 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-01-11 21:23:22,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-01-11 21:23:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-11 21:23:22,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:22,169 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-11 21:23:22,169 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 798876465, now seen corresponding path program 1 times [2019-01-11 21:23:22,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:22,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:22,339 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-11 21:23:22,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:22,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:22,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:22,342 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-01-11 21:23:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:22,610 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-01-11 21:23:22,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:22,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-01-11 21:23:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:22,622 INFO L225 Difference]: With dead ends: 5545 [2019-01-11 21:23:22,622 INFO L226 Difference]: Without dead ends: 2930 [2019-01-11 21:23:22,627 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-11 21:23:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-01-11 21:23:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-01-11 21:23:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-01-11 21:23:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-01-11 21:23:22,686 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-01-11 21:23:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:22,686 INFO L480 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-01-11 21:23:22,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-01-11 21:23:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-11 21:23:22,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:22,694 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-11 21:23:22,694 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash 668596020, now seen corresponding path program 1 times [2019-01-11 21:23:22,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:22,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:22,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-11 21:23:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:22,887 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-01-11 21:23:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:23,094 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-01-11 21:23:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:23,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-01-11 21:23:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:23,121 INFO L225 Difference]: With dead ends: 7734 [2019-01-11 21:23:23,126 INFO L226 Difference]: Without dead ends: 5029 [2019-01-11 21:23:23,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-11 21:23:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-01-11 21:23:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-01-11 21:23:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-01-11 21:23:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-01-11 21:23:23,240 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-01-11 21:23:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:23,241 INFO L480 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-01-11 21:23:23,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-01-11 21:23:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-11 21:23:23,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:23,251 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:23:23,252 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1546862455, now seen corresponding path program 1 times [2019-01-11 21:23:23,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:23,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:23,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:23,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-01-11 21:23:23,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:23,501 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-11 21:23:23,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:23,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-01-11 21:23:23,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:23:23,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:23:23,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:23:23,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:23:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:23:23,907 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-01-11 21:23:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:25,985 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-01-11 21:23:25,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:23:25,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-01-11 21:23:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:26,015 INFO L225 Difference]: With dead ends: 9987 [2019-01-11 21:23:26,016 INFO L226 Difference]: Without dead ends: 7540 [2019-01-11 21:23:26,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-01-11 21:23:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-01-11 21:23:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-01-11 21:23:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-01-11 21:23:26,174 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 360 [2019-01-11 21:23:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:26,174 INFO L480 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-01-11 21:23:26,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:23:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-01-11 21:23:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-01-11 21:23:26,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:26,186 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-11 21:23:26,186 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:26,186 INFO L82 PathProgramCache]: Analyzing trace with hash 774755817, now seen corresponding path program 2 times [2019-01-11 21:23:26,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:26,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:26,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:26,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:26,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:26,460 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-11 21:23:26,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:26,461 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-11 21:23:26,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-11 21:23:26,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-11 21:23:26,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 21:23:26,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:26,725 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-11 21:23:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:23:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:23:26,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:23:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:23:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:23:26,745 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-01-11 21:23:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:28,378 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-01-11 21:23:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:23:28,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-01-11 21:23:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:28,394 INFO L225 Difference]: With dead ends: 12544 [2019-01-11 21:23:28,395 INFO L226 Difference]: Without dead ends: 6979 [2019-01-11 21:23:28,402 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-11 21:23:28,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-01-11 21:23:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-01-11 21:23:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-01-11 21:23:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-01-11 21:23:28,539 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-01-11 21:23:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:28,540 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-01-11 21:23:28,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:23:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-01-11 21:23:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-01-11 21:23:28,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:28,551 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-11 21:23:28,551 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash 256545513, now seen corresponding path program 1 times [2019-01-11 21:23:28,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:28,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:28,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:28,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 21:23:28,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:28,724 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-11 21:23:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:28,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:28,728 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-01-11 21:23:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:29,478 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-01-11 21:23:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:29,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-01-11 21:23:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:29,487 INFO L225 Difference]: With dead ends: 11015 [2019-01-11 21:23:29,487 INFO L226 Difference]: Without dead ends: 3069 [2019-01-11 21:23:29,497 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-11 21:23:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-01-11 21:23:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-01-11 21:23:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-01-11 21:23:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-01-11 21:23:29,557 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-01-11 21:23:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:29,558 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-01-11 21:23:29,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-01-11 21:23:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-01-11 21:23:29,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:29,568 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 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, 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-11 21:23:29,568 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 930203824, now seen corresponding path program 1 times [2019-01-11 21:23:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:29,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-01-11 21:23:29,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:29,903 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-11 21:23:29,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:30,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2019-01-11 21:23:30,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:23:30,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:23:30,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:23:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:23:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:30,320 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 5 states. [2019-01-11 21:23:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:30,556 INFO L93 Difference]: Finished difference Result 3603 states and 4841 transitions. [2019-01-11 21:23:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:23:30,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 510 [2019-01-11 21:23:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:30,557 INFO L225 Difference]: With dead ends: 3603 [2019-01-11 21:23:30,557 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:23:30,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 512 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-11 21:23:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:23:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:23:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:23:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:23:30,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 510 [2019-01-11 21:23:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:30,563 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:23:30,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:23:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:23:30,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:23:30,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:23:30,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:30,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,102 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 103 [2019-01-11 21:23:31,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:31,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:32,258 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 48 DAG size of output: 7 [2019-01-11 21:23:32,382 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-01-11 21:23:32,575 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-01-11 21:23:32,808 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2019-01-11 21:23:32,950 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2019-01-11 21:23:33,544 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-01-11 21:23:33,708 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-01-11 21:23:33,709 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2019-01-11 21:23:33,709 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2019-01-11 21:23:33,709 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2019-01-11 21:23:33,709 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2019-01-11 21:23:33,709 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2019-01-11 21:23:33,709 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) 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-11 21:23:33,710 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= ULTIMATE.start_ssl3_connect_~s__state~0 12292)) [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2019-01-11 21:23:33,710 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) 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-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2019-01-11 21:23:33,711 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) 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-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2019-01-11 21:23:33,712 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) 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-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2019-01-11 21:23:33,713 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) 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-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-01-11 21:23:33,714 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) 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-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2019-01-11 21:23:33,715 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L451 ceAbstractionStarter]: At program point L550(lines 11 552) the Hoare annotation is: true [2019-01-11 21:23:33,716 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) 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-11 21:23:33,716 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) 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-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2019-01-11 21:23:33,716 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) 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-11 21:23:33,717 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2019-01-11 21:23:33,717 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: false [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2019-01-11 21:23:33,718 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2019-01-11 21:23:33,719 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) 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-11 21:23:33,720 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) 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-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2019-01-11 21:23:33,720 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) 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-11 21:23:33,721 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) 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-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L451 ceAbstractionStarter]: At program point L561(lines 553 563) the Hoare annotation is: true [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2019-01-11 21:23:33,721 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2019-01-11 21:23:33,722 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2019-01-11 21:23:33,722 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2019-01-11 21:23:33,722 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) 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-11 21:23:33,722 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:23:33,722 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-01-11 21:23:33,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:23:33 BoogieIcfgContainer [2019-01-11 21:23:33,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:23:33,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:23:33,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:23:33,748 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:23:33,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:11" (3/4) ... [2019-01-11 21:23:33,753 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:23:33,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:23:33,780 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:23:33,934 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:23:33,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:23:33,935 INFO L168 Benchmark]: Toolchain (without parser) took 24325.36 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 693.1 MB). Free memory was 951.3 MB in the beginning and 1.5 GB in the end (delta: -525.5 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,937 INFO L168 Benchmark]: CDTParser took 0.16 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-11 21:23:33,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,939 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,940 INFO L168 Benchmark]: RCFGBuilder took 1224.43 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,940 INFO L168 Benchmark]: TraceAbstraction took 22300.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 556.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -417.6 MB). Peak memory consumption was 698.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:33,942 INFO L168 Benchmark]: Witness Printer took 186.17 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-11 21:23:33,945 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.16 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 444.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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 126.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.21 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1224.43 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22300.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 556.8 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -417.6 MB). Peak memory consumption was 698.2 MB. Max. memory is 11.5 GB. * Witness Printer took 186.17 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 105]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 171]: 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: 129]: 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: 183]: 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) - InvariantResult [Line: 141]: 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: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: 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: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 177]: 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: 135]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && s__hit == 0 - InvariantResult [Line: 189]: 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: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: 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: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: 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: 153]: 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: 117]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 195]: 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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. SAFE Result, 22.2s OverallTime, 23 OverallIterations, 20 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4190 SDtfs, 2039 SDslu, 2326 SDs, 0 SdLazy, 2384 SolverSat, 589 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 1288 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s 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.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6263 ConstructedInterpolants, 0 QuantifiedInterpolants, 3048889 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2137 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 25139/25183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...