./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.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/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.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 cfc4572bc150d8d2f9b1a5737590a88a31fdad6b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16:40,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:16:40,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:16:40,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:16:40,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:16:40,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:16:40,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:16:40,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:16:40,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:16:40,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:16:40,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:16:40,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:16:40,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:16:40,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:16:40,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:16:40,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:16:40,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:16:40,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:16:40,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:16:40,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:16:40,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:16:40,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:16:40,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:16:40,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:16:40,524 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:16:40,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:16:40,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:16:40,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:16:40,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:16:40,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:16:40,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:16:40,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:16:40,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:16:40,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:16:40,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:16:40,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:16:40,538 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:16:40,567 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:16:40,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:16:40,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:16:40,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:16:40,568 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:16:40,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:16:40,569 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:16:40,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:16:40,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:16:40,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:16:40,571 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:16:40,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:16:40,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:16:40,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:16:40,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:16:40,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:16:40,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:40,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:16:40,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:16:40,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:16:40,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:16:40,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:16:40,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:16:40,574 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 -> cfc4572bc150d8d2f9b1a5737590a88a31fdad6b [2019-01-11 21:16:40,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:16:40,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:16:40,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:16:40,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:16:40,649 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:16:40,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:40,709 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd35d743/8360e24928a840daaaf7a84eecec6a2c/FLAG9154c495c [2019-01-11 21:16:41,163 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:16:41,168 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:41,183 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd35d743/8360e24928a840daaaf7a84eecec6a2c/FLAG9154c495c [2019-01-11 21:16:41,521 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd35d743/8360e24928a840daaaf7a84eecec6a2c [2019-01-11 21:16:41,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:16:41,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:16:41,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:41,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:16:41,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:16:41,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:41" (1/1) ... [2019-01-11 21:16:41,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437db60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:41, skipping insertion in model container [2019-01-11 21:16:41,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:41" (1/1) ... [2019-01-11 21:16:41,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:16:41,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:16:41,895 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:41,900 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:16:42,012 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:42,026 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:16:42,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42 WrapperNode [2019-01-11 21:16:42,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:42,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:42,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:16:42,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:16:42,097 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:16:42" (1/1) ... [2019-01-11 21:16:42,108 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:16:42" (1/1) ... [2019-01-11 21:16:42,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:42,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:16:42,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:16:42,164 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:16:42,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (1/1) ... [2019-01-11 21:16:42,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:16:42,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:16:42,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:16:42,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:16:42,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (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:16:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:16:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:16:42,431 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:16:43,610 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:16:43,610 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:16:43,612 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:16:43,612 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:16:43,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:43 BoogieIcfgContainer [2019-01-11 21:16:43,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:16:43,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:16:43,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:16:43,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:16:43,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:16:41" (1/3) ... [2019-01-11 21:16:43,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf585b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:43, skipping insertion in model container [2019-01-11 21:16:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:42" (2/3) ... [2019-01-11 21:16:43,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf585b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:43, skipping insertion in model container [2019-01-11 21:16:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:43" (3/3) ... [2019-01-11 21:16:43,620 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:43,629 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:16:43,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:16:43,652 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:16:43,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:16:43,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:16:43,685 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:16:43,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:16:43,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:16:43,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:16:43,686 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:16:43,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:16:43,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:16:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-01-11 21:16:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:16:43,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:43,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:43,722 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-01-11 21:16:43,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,970 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:16:43,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:43,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,996 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-01-11 21:16:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:44,855 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-01-11 21:16:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:44,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:16:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:44,872 INFO L225 Difference]: With dead ends: 322 [2019-01-11 21:16:44,872 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 21:16:44,877 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:16:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 21:16:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-01-11 21:16:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 21:16:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-01-11 21:16:44,929 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-01-11 21:16:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:44,930 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-01-11 21:16:44,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-01-11 21:16:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:16:44,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:44,933 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, 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:16:44,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-01-11 21:16:44,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,048 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:16:45,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:45,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,053 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-01-11 21:16:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:45,525 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-01-11 21:16:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:45,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:16:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:45,530 INFO L225 Difference]: With dead ends: 371 [2019-01-11 21:16:45,530 INFO L226 Difference]: Without dead ends: 211 [2019-01-11 21:16:45,532 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:16:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-11 21:16:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-01-11 21:16:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 21:16:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-01-11 21:16:45,552 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-01-11 21:16:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:45,553 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-01-11 21:16:45,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-01-11 21:16:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:16:45,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:45,557 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:16:45,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-01-11 21:16:45,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:45,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:45,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:45,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,648 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-01-11 21:16:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,033 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-01-11 21:16:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:46,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:16:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,037 INFO L225 Difference]: With dead ends: 436 [2019-01-11 21:16:46,037 INFO L226 Difference]: Without dead ends: 237 [2019-01-11 21:16:46,039 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:16:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-11 21:16:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-01-11 21:16:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-11 21:16:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-01-11 21:16:46,059 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-01-11 21:16:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,060 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-01-11 21:16:46,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-01-11 21:16:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:16:46,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,065 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:46,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-01-11 21:16:46,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:46,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:46,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,164 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-01-11 21:16:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,500 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-01-11 21:16:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:46,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:16:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,503 INFO L225 Difference]: With dead ends: 484 [2019-01-11 21:16:46,504 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 21:16:46,505 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:16:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 21:16:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-01-11 21:16:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 21:16:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-01-11 21:16:46,522 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-01-11 21:16:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,523 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-01-11 21:16:46,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-01-11 21:16:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:16:46,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,526 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:16:46,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-01-11 21:16:46,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:46,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:46,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:46,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:46,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,656 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-01-11 21:16:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,953 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-01-11 21:16:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:46,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:16:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,956 INFO L225 Difference]: With dead ends: 543 [2019-01-11 21:16:46,956 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 21:16:46,958 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:16:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 21:16:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-01-11 21:16:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-11 21:16:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-01-11 21:16:46,979 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-01-11 21:16:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,981 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-01-11 21:16:46,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-01-11 21:16:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:16:46,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,984 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:16:46,984 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-01-11 21:16:46,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:47,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:47,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:47,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,080 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-01-11 21:16:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:47,552 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-01-11 21:16:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:47,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:16:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:47,555 INFO L225 Difference]: With dead ends: 583 [2019-01-11 21:16:47,555 INFO L226 Difference]: Without dead ends: 296 [2019-01-11 21:16:47,556 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:16:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-11 21:16:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-01-11 21:16:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-11 21:16:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-01-11 21:16:47,574 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-01-11 21:16:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:47,575 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-01-11 21:16:47,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-01-11 21:16:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:16:47,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:47,577 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:16:47,577 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-01-11 21:16:47,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:47,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:47,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:47,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:47,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:47,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,726 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-01-11 21:16:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,653 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-01-11 21:16:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:16:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:48,657 INFO L225 Difference]: With dead ends: 585 [2019-01-11 21:16:48,657 INFO L226 Difference]: Without dead ends: 296 [2019-01-11 21:16:48,659 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:16:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-11 21:16:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-01-11 21:16:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 21:16:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-01-11 21:16:48,672 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-01-11 21:16:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:48,672 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-01-11 21:16:48,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-01-11 21:16:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 21:16:48,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:48,676 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:48,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-01-11 21:16:48,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:48,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:16:48,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:48,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,753 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-01-11 21:16:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:49,891 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-01-11 21:16:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:49,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-11 21:16:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,894 INFO L225 Difference]: With dead ends: 585 [2019-01-11 21:16:49,894 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:16:49,895 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:16:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:16:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-01-11 21:16:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-11 21:16:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-01-11 21:16:49,910 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-01-11 21:16:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,910 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-01-11 21:16:49,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-01-11 21:16:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:16:49,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,912 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:16:49,912 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-01-11 21:16:49,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:50,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:50,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,042 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-01-11 21:16:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:50,627 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-01-11 21:16:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:50,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:16:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:50,630 INFO L225 Difference]: With dead ends: 624 [2019-01-11 21:16:50,630 INFO L226 Difference]: Without dead ends: 331 [2019-01-11 21:16:50,631 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:16:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-01-11 21:16:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-01-11 21:16:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 21:16:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-01-11 21:16:50,646 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-01-11 21:16:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:50,646 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-01-11 21:16:50,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-01-11 21:16:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:16:50,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:50,648 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:50,648 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-01-11 21:16:50,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,757 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-01-11 21:16:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:51,160 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-01-11 21:16:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:16:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:51,163 INFO L225 Difference]: With dead ends: 685 [2019-01-11 21:16:51,163 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 21:16:51,165 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:16:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 21:16:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-01-11 21:16:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-01-11 21:16:51,178 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-01-11 21:16:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:51,184 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-01-11 21:16:51,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-01-11 21:16:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:16:51,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:51,187 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:16:51,187 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-01-11 21:16:51,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:51,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:51,240 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-01-11 21:16:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:51,862 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-01-11 21:16:51,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:51,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:16:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:51,865 INFO L225 Difference]: With dead ends: 707 [2019-01-11 21:16:51,865 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 21:16:51,866 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:16:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 21:16:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-01-11 21:16:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-01-11 21:16:51,877 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-01-11 21:16:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:51,878 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-01-11 21:16:51,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-01-11 21:16:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:16:51,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:51,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:51,880 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-01-11 21:16:51,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:51,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:51,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:51,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:51,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:51,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:51,979 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-01-11 21:16:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:52,540 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-01-11 21:16:52,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:52,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:16:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:52,545 INFO L225 Difference]: With dead ends: 712 [2019-01-11 21:16:52,545 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 21:16:52,546 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:16:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 21:16:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-01-11 21:16:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-01-11 21:16:52,561 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-01-11 21:16:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:52,562 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-01-11 21:16:52,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-01-11 21:16:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:16:52,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:52,566 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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:16:52,566 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-01-11 21:16:52,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:52,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:52,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:52,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:52,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:52,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:52,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:52,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:52,675 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-01-11 21:16:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:53,144 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-01-11 21:16:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:53,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:16:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:53,147 INFO L225 Difference]: With dead ends: 730 [2019-01-11 21:16:53,147 INFO L226 Difference]: Without dead ends: 381 [2019-01-11 21:16:53,148 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:16:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-11 21:16:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-01-11 21:16:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 21:16:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-01-11 21:16:53,163 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-01-11 21:16:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:53,164 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-01-11 21:16:53,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-01-11 21:16:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:16:53,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:53,167 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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:16:53,167 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-01-11 21:16:53,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:53,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:53,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:53,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:53,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:53,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:53,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:53,285 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-01-11 21:16:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:53,885 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-01-11 21:16:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:53,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:16:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:53,888 INFO L225 Difference]: With dead ends: 751 [2019-01-11 21:16:53,888 INFO L226 Difference]: Without dead ends: 381 [2019-01-11 21:16:53,889 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:16:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-11 21:16:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-01-11 21:16:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 21:16:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-01-11 21:16:53,901 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-01-11 21:16:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:53,902 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-01-11 21:16:53,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-01-11 21:16:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:16:53,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:53,904 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:53,904 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-01-11 21:16:53,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:53,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:16:54,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:54,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:54,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:54,008 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-01-11 21:16:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:54,293 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-01-11 21:16:54,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:54,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:16:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:54,300 INFO L225 Difference]: With dead ends: 747 [2019-01-11 21:16:54,301 INFO L226 Difference]: Without dead ends: 745 [2019-01-11 21:16:54,301 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:16:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-01-11 21:16:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-01-11 21:16:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-01-11 21:16:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-01-11 21:16:54,328 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-01-11 21:16:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-01-11 21:16:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-01-11 21:16:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:16:54,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:54,332 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:54,332 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-01-11 21:16:54,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:54,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:54,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:54,344 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:54,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:54,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:54,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:54,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:54,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:54,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:54,541 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-01-11 21:16:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:54,786 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-01-11 21:16:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:54,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:16:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:54,795 INFO L225 Difference]: With dead ends: 1851 [2019-01-11 21:16:54,795 INFO L226 Difference]: Without dead ends: 1113 [2019-01-11 21:16:54,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:16:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-01-11 21:16:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-01-11 21:16:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-01-11 21:16:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-01-11 21:16:54,861 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-01-11 21:16:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:54,861 INFO L480 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-01-11 21:16:54,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-01-11 21:16:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-11 21:16:54,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:54,865 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:54,865 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:54,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-01-11 21:16:54,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,877 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:54,877 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:54,877 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:54,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:54,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:55,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:55,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:55,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:55,100 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-01-11 21:16:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:55,381 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-01-11 21:16:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:55,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-11 21:16:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:55,392 INFO L225 Difference]: With dead ends: 2219 [2019-01-11 21:16:55,392 INFO L226 Difference]: Without dead ends: 1481 [2019-01-11 21:16:55,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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:16:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-01-11 21:16:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-01-11 21:16:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-01-11 21:16:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-01-11 21:16:55,464 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-01-11 21:16:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:55,464 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-01-11 21:16:55,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-01-11 21:16:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-11 21:16:55,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:55,473 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:55,473 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-01-11 21:16:55,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:55,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-11 21:16:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:55,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:55,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:55,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:55,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:55,573 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-01-11 21:16:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:56,597 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-01-11 21:16:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-11 21:16:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:56,606 INFO L225 Difference]: With dead ends: 3059 [2019-01-11 21:16:56,606 INFO L226 Difference]: Without dead ends: 1585 [2019-01-11 21:16:56,609 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:16:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-01-11 21:16:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-01-11 21:16:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-01-11 21:16:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-01-11 21:16:56,671 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-01-11 21:16:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:56,671 INFO L480 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-01-11 21:16:56,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-01-11 21:16:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-11 21:16:56,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:56,675 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:56,675 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-01-11 21:16:56,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,685 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:56,686 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:56,686 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:56,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:56,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:16:56,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:56,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:56,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:56,872 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-01-11 21:16:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:57,138 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-01-11 21:16:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:57,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-11 21:16:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:57,149 INFO L225 Difference]: With dead ends: 3139 [2019-01-11 21:16:57,149 INFO L226 Difference]: Without dead ends: 1964 [2019-01-11 21:16:57,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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:16:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-11 21:16:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-11 21:16:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-11 21:16:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-01-11 21:16:57,228 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-01-11 21:16:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:57,228 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-01-11 21:16:57,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-01-11 21:16:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 21:16:57,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:57,236 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-11 21:16:57,236 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-01-11 21:16:57,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:57,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:57,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-11 21:16:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:57,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:57,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:57,486 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-01-11 21:16:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:57,724 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-01-11 21:16:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:57,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-01-11 21:16:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:57,741 INFO L225 Difference]: With dead ends: 5743 [2019-01-11 21:16:57,742 INFO L226 Difference]: Without dead ends: 3786 [2019-01-11 21:16:57,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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:16:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-01-11 21:16:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-01-11 21:16:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:16:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-01-11 21:16:57,863 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-01-11 21:16:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:57,863 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-01-11 21:16:57,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-01-11 21:16:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-11 21:16:57,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:57,872 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-11 21:16:57,872 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-01-11 21:16:57,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:57,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,884 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:57,884 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:57,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:57,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-11 21:16:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:58,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:58,087 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-01-11 21:16:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:59,292 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-01-11 21:16:59,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:59,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-01-11 21:16:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:59,313 INFO L225 Difference]: With dead ends: 7651 [2019-01-11 21:16:59,314 INFO L226 Difference]: Without dead ends: 3874 [2019-01-11 21:16:59,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 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:16:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-01-11 21:16:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-01-11 21:16:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:16:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-01-11 21:16:59,443 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-01-11 21:16:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-01-11 21:16:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-01-11 21:16:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-11 21:16:59,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:59,454 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-11 21:16:59,454 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:59,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:59,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-01-11 21:16:59,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:59,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:59,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-01-11 21:16:59,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:59,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:59,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:59,580 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-01-11 21:17:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:00,038 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-01-11 21:17:00,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:00,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-01-11 21:17:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:00,055 INFO L225 Difference]: With dead ends: 7683 [2019-01-11 21:17:00,055 INFO L226 Difference]: Without dead ends: 3906 [2019-01-11 21:17:00,061 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:17:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-01-11 21:17:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-01-11 21:17:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:17:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-01-11 21:17:00,176 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-01-11 21:17:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:00,177 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-01-11 21:17:00,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-01-11 21:17:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-01-11 21:17:00,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:00,186 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-01-11 21:17:00,186 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:00,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:00,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-01-11 21:17:00,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:00,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,199 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:17:00,199 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:17:00,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:17:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:00,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-01-11 21:17:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:00,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:00,400 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-01-11 21:17:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:00,784 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-01-11 21:17:00,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:00,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-01-11 21:17:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:00,819 INFO L225 Difference]: With dead ends: 7561 [2019-01-11 21:17:00,824 INFO L226 Difference]: Without dead ends: 3784 [2019-01-11 21:17:00,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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:17:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-01-11 21:17:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-01-11 21:17:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:17:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-01-11 21:17:00,952 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-01-11 21:17:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:00,952 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-01-11 21:17:00,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-01-11 21:17:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 21:17:00,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:00,962 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:17:00,962 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-01-11 21:17:00,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:00,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,980 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:17:00,981 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:17:00,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:17:00,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:01,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-11 21:17:01,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:01,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:01,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,214 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-01-11 21:17:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:01,508 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-01-11 21:17:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:01,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-01-11 21:17:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:01,515 INFO L225 Difference]: With dead ends: 7951 [2019-01-11 21:17:01,516 INFO L226 Difference]: Without dead ends: 2307 [2019-01-11 21:17:01,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 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:17:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-01-11 21:17:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-01-11 21:17:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-01-11 21:17:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-01-11 21:17:01,579 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-01-11 21:17:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:01,579 INFO L480 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-01-11 21:17:01,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-01-11 21:17:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-11 21:17:01,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:01,585 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-01-11 21:17:01,586 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-01-11 21:17:01,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:01,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 21:17:01,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:01,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:01,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,684 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-01-11 21:17:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:01,938 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-01-11 21:17:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:01,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-01-11 21:17:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:01,944 INFO L225 Difference]: With dead ends: 4829 [2019-01-11 21:17:01,944 INFO L226 Difference]: Without dead ends: 2529 [2019-01-11 21:17:01,946 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:17:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-01-11 21:17:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-01-11 21:17:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-11 21:17:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-01-11 21:17:02,007 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-01-11 21:17:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:02,007 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-01-11 21:17:02,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-01-11 21:17:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-11 21:17:02,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:02,012 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-01-11 21:17:02,012 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-01-11 21:17:02,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:02,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:02,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-01-11 21:17:02,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:02,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:02,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:02,173 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-01-11 21:17:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:02,784 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-01-11 21:17:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:02,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-01-11 21:17:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:02,790 INFO L225 Difference]: With dead ends: 4949 [2019-01-11 21:17:02,791 INFO L226 Difference]: Without dead ends: 2499 [2019-01-11 21:17:02,793 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:17:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-01-11 21:17:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-01-11 21:17:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-11 21:17:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-01-11 21:17:02,855 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-01-11 21:17:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:02,855 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-01-11 21:17:02,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-01-11 21:17:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-01-11 21:17:02,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:02,862 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:17:02,862 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-01-11 21:17:02,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 21:17:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:03,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:03,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 21:17:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:17:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:03,341 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-01-11 21:17:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:03,780 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-01-11 21:17:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:17:03,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-01-11 21:17:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:03,789 INFO L225 Difference]: With dead ends: 6557 [2019-01-11 21:17:03,790 INFO L226 Difference]: Without dead ends: 3975 [2019-01-11 21:17:03,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 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:17:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-01-11 21:17:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-01-11 21:17:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-01-11 21:17:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-01-11 21:17:03,896 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-01-11 21:17:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:03,897 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-01-11 21:17:03,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-01-11 21:17:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-01-11 21:17:03,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:03,911 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-01-11 21:17:03,911 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-01-11 21:17:03,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:03,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-01-11 21:17:04,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:04,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:04,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:04,263 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-01-11 21:17:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:05,112 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-01-11 21:17:05,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:05,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-01-11 21:17:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:05,118 INFO L225 Difference]: With dead ends: 5073 [2019-01-11 21:17:05,118 INFO L226 Difference]: Without dead ends: 2546 [2019-01-11 21:17:05,122 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:17:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-01-11 21:17:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-01-11 21:17:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-01-11 21:17:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-01-11 21:17:05,176 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-01-11 21:17:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-01-11 21:17:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-01-11 21:17:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-01-11 21:17:05,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:05,183 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:05,183 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-01-11 21:17:05,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:05,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:05,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:05,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-01-11 21:17:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:05,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:05,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:05,401 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-01-11 21:17:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:06,147 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-01-11 21:17:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:06,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-01-11 21:17:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:06,153 INFO L225 Difference]: With dead ends: 5277 [2019-01-11 21:17:06,153 INFO L226 Difference]: Without dead ends: 2750 [2019-01-11 21:17:06,158 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:17:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-01-11 21:17:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-01-11 21:17:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-01-11 21:17:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-01-11 21:17:06,229 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-01-11 21:17:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:06,231 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-01-11 21:17:06,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-01-11 21:17:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-01-11 21:17:06,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:06,238 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,240 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-01-11 21:17:06,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:06,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-01-11 21:17:06,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:06,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:06,481 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-01-11 21:17:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:06,686 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-01-11 21:17:06,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:06,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-01-11 21:17:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:06,693 INFO L225 Difference]: With dead ends: 5697 [2019-01-11 21:17:06,694 INFO L226 Difference]: Without dead ends: 2966 [2019-01-11 21:17:06,697 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:17:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-01-11 21:17:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-01-11 21:17:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-01-11 21:17:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-01-11 21:17:06,777 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-01-11 21:17:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:06,777 INFO L480 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-01-11 21:17:06,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-01-11 21:17:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-01-11 21:17:06,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:06,787 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,787 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-01-11 21:17:06,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:17:07,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:07,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:07,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:17:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:17:07,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:07,413 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-01-11 21:17:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:07,637 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-01-11 21:17:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:07,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-01-11 21:17:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:07,644 INFO L225 Difference]: With dead ends: 4704 [2019-01-11 21:17:07,645 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:17:07,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 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:17:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:17:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:17:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:17:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:17:07,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-01-11 21:17:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:17:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:17:07,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:17:07,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:17:07,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,979 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2019-01-11 21:17:08,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,159 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2019-01-11 21:17:08,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,716 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:10,037 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:10,307 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:11,160 WARN L181 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-01-11 21:17:11,319 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 21:17:11,642 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-01-11 21:17:11,829 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:12,085 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-11 21:17:12,235 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-11 21:17:12,391 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-01-11 21:17:12,538 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-01-11 21:17:12,812 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:13,181 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:15,135 WARN L181 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-01-11 21:17:15,437 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-11 21:17:15,609 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:15,784 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:15,971 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:16,174 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:16,177 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L444 ceAbstractionStarter]: At program point L201(lines 197 591) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:17:16,178 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 623) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 503) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 666) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point L499-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 589) no Hoare annotation was computed. [2019-01-11 21:17:16,178 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 600) no Hoare annotation was computed. [2019-01-11 21:17:16,179 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 611) no Hoare annotation was computed. [2019-01-11 21:17:16,179 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 622) no Hoare annotation was computed. [2019-01-11 21:17:16,181 INFO L444 ceAbstractionStarter]: At program point L204(lines 203 589) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:16,181 INFO L444 ceAbstractionStarter]: At program point L171(lines 167 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:16,182 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 612) the Hoare annotation is: (let ((.cse0 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 579) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L569-1(lines 569 579) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 599) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 610) no Hoare annotation was computed. [2019-01-11 21:17:16,182 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 621) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 588) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L451 ceAbstractionStarter]: At program point L670(lines 63 672) the Hoare annotation is: true [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 543) no Hoare annotation was computed. [2019-01-11 21:17:16,183 INFO L444 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:16,183 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-01-11 21:17:16,184 INFO L448 ceAbstractionStarter]: For program point L340-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,184 INFO L451 ceAbstractionStarter]: At program point L671(lines 8 673) the Hoare annotation is: true [2019-01-11 21:17:16,186 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 576) no Hoare annotation was computed. [2019-01-11 21:17:16,187 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 598) no Hoare annotation was computed. [2019-01-11 21:17:16,187 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 609) no Hoare annotation was computed. [2019-01-11 21:17:16,187 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 620) no Hoare annotation was computed. [2019-01-11 21:17:16,187 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2019-01-11 21:17:16,187 INFO L444 ceAbstractionStarter]: At program point L177(lines 173 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:16,187 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 610) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:16,187 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L444 ceAbstractionStarter]: At program point L211(lines 104 622) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L509-2(lines 509 513) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 597) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 608) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 619) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 63 672) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 596) no Hoare annotation was computed. [2019-01-11 21:17:16,188 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 607) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 618) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2019-01-11 21:17:16,189 INFO L444 ceAbstractionStarter]: At program point L183(lines 179 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:16,189 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 608) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:16,189 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 552) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 595) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 606) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 617) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L444 ceAbstractionStarter]: At program point L549(lines 63 672) the Hoare annotation is: false [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2019-01-11 21:17:16,190 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 618) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:16,190 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2019-01-11 21:17:16,191 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2019-01-11 21:17:16,193 INFO L451 ceAbstractionStarter]: At program point L683(lines 674 685) the Hoare annotation is: true [2019-01-11 21:17:16,193 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2019-01-11 21:17:16,193 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 594) no Hoare annotation was computed. [2019-01-11 21:17:16,193 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 605) no Hoare annotation was computed. [2019-01-11 21:17:16,193 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 616) no Hoare annotation was computed. [2019-01-11 21:17:16,194 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-01-11 21:17:16,194 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2019-01-11 21:17:16,195 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-01-11 21:17:16,195 INFO L448 ceAbstractionStarter]: For program point L288-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,195 INFO L444 ceAbstractionStarter]: At program point L189(lines 185 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:16,196 INFO L444 ceAbstractionStarter]: At program point L156(lines 152 606) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:16,196 INFO L444 ceAbstractionStarter]: At program point L123(lines 122 616) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:17:16,196 INFO L444 ceAbstractionStarter]: At program point L586(lines 98 654) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-01-11 21:17:16,196 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 593) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 604) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 615) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L451 ceAbstractionStarter]: At program point L655(lines 97 656) the Hoare annotation is: true [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 592) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 603) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 614) no Hoare annotation was computed. [2019-01-11 21:17:16,197 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 652) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L444 ceAbstractionStarter]: At program point L195(lines 191 593) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:16,198 INFO L444 ceAbstractionStarter]: At program point L162(lines 158 604) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 649) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L559-2(lines 559 563) no Hoare annotation was computed. [2019-01-11 21:17:16,198 INFO L448 ceAbstractionStarter]: For program point L526-2(lines 208 585) no Hoare annotation was computed. [2019-01-11 21:17:16,199 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L659(lines 659 663) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 635) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L659-2(lines 659 663) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 625 647) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-01-11 21:17:16,201 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-01-11 21:17:16,202 INFO L444 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:16,202 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2019-01-11 21:17:16,202 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 591) no Hoare annotation was computed. [2019-01-11 21:17:16,202 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 602) no Hoare annotation was computed. [2019-01-11 21:17:16,202 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 613) no Hoare annotation was computed. [2019-01-11 21:17:16,202 INFO L444 ceAbstractionStarter]: At program point L98-2(lines 98 654) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2019-01-11 21:17:16,202 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:16,202 INFO L444 ceAbstractionStarter]: At program point L165(lines 164 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-11 21:17:16,203 INFO L444 ceAbstractionStarter]: At program point L132(lines 125 615) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 632) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 590) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 601) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 612) no Hoare annotation was computed. [2019-01-11 21:17:16,203 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 623) no Hoare annotation was computed. [2019-01-11 21:17:16,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:17:16 BoogieIcfgContainer [2019-01-11 21:17:16,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:17:16,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:17:16,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:17:16,261 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:17:16,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:43" (3/4) ... [2019-01-11 21:17:16,272 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:17:16,306 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:17:16,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:17:16,487 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:17:16,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:17:16,491 INFO L168 Benchmark]: Toolchain (without parser) took 34966.08 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 791.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -99.5 MB). Peak memory consumption was 691.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,493 INFO L168 Benchmark]: CDTParser took 0.14 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:17:16,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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:17:16,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,494 INFO L168 Benchmark]: Boogie Preprocessor took 69.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:16,494 INFO L168 Benchmark]: RCFGBuilder took 1379.79 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,494 INFO L168 Benchmark]: TraceAbstraction took 32647.04 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 642.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 726.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,495 INFO L168 Benchmark]: Witness Printer took 229.41 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,501 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.14 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 499.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 135.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1379.79 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32647.04 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 642.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 726.8 MB. Max. memory is 11.5 GB. * Witness Printer took 229.41 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 666]: 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: 140]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && !(8673 == s__state)) && 8672 <= s__state) && !(8672 == s__state)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. SAFE Result, 32.5s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 16.5s AutomataDifference, 0.0s DeadEndRemovalTime, 8.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, 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.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1971 HoareAnnotationTreeSize, 29 FomulaSimplifications, 39550 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7460 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3954 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...