./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_7_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_7_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e1396fe6b795e5287c3ace5fe4eb7f5179243eb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:59:08,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:59:08,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:59:08,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:59:08,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:59:08,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:59:08,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:59:08,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:59:08,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:59:08,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:59:08,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:59:08,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:59:08,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:59:08,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:59:08,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:59:08,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:59:08,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:59:08,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:59:08,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:59:08,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:59:08,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:59:08,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:59:08,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:59:08,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:59:08,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:59:08,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:59:08,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:59:08,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:59:08,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:59:08,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:59:08,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:59:08,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:59:08,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:59:08,490 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:59:08,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:59:08,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:59:08,494 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:59:08,518 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:59:08,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:59:08,521 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:59:08,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:59:08,521 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:59:08,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:59:08,521 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:59:08,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:59:08,523 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:59:08,524 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:59:08,524 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:59:08,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:59:08,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:59:08,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:59:08,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:59:08,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:08,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:59:08,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:59:08,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:59:08,525 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:59:08,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:59:08,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:59:08,528 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 -> 3e1396fe6b795e5287c3ace5fe4eb7f5179243eb [2019-01-14 14:59:08,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:59:08,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:59:08,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:59:08,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:59:08,593 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:59:08,596 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_7_true-unreach-call_false-termination.cil.c [2019-01-14 14:59:08,659 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858ee1ac/4c3ebeb4cd1f485d89ed1db33b0b86a6/FLAG33b390cca [2019-01-14 14:59:09,118 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:59:09,118 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_7_true-unreach-call_false-termination.cil.c [2019-01-14 14:59:09,130 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858ee1ac/4c3ebeb4cd1f485d89ed1db33b0b86a6/FLAG33b390cca [2019-01-14 14:59:09,476 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858ee1ac/4c3ebeb4cd1f485d89ed1db33b0b86a6 [2019-01-14 14:59:09,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:59:09,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:59:09,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:09,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:59:09,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:59:09,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:09,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf550ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09, skipping insertion in model container [2019-01-14 14:59:09,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:09,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:59:09,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:59:09,837 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:09,842 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:59:09,906 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:09,924 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:59:09,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09 WrapperNode [2019-01-14 14:59:09,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:09,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:09,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:59:09,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:59:09,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:09,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:10,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:59:10,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:59:10,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:59:10,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... [2019-01-14 14:59:10,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:59:10,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:59:10,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:59:10,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:59:10,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:59:10,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:59:10,311 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:59:11,379 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:59:11,380 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:59:11,382 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:59:11,382 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:59:11,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:11 BoogieIcfgContainer [2019-01-14 14:59:11,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:59:11,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:59:11,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:59:11,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:59:11,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:59:09" (1/3) ... [2019-01-14 14:59:11,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c35b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:11, skipping insertion in model container [2019-01-14 14:59:11,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:09" (2/3) ... [2019-01-14 14:59:11,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c35b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:11, skipping insertion in model container [2019-01-14 14:59:11,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:11" (3/3) ... [2019-01-14 14:59:11,395 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7_true-unreach-call_false-termination.cil.c [2019-01-14 14:59:11,406 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:59:11,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:59:11,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:59:11,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:59:11,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:59:11,474 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:59:11,474 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:59:11,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:59:11,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:59:11,474 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:59:11,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:59:11,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:59:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-01-14 14:59:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 14:59:11,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:11,501 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] [2019-01-14 14:59:11,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times [2019-01-14 14:59:11,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:11,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:11,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:11,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:11,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:11,786 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-01-14 14:59:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:12,515 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2019-01-14 14:59:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:12,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-14 14:59:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:12,532 INFO L225 Difference]: With dead ends: 328 [2019-01-14 14:59:12,532 INFO L226 Difference]: Without dead ends: 170 [2019-01-14 14:59:12,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-14 14:59:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2019-01-14 14:59:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-14 14:59:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2019-01-14 14:59:12,593 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32 [2019-01-14 14:59:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:12,594 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2019-01-14 14:59:12,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2019-01-14 14:59:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 14:59:12,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:12,596 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] [2019-01-14 14:59:12,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times [2019-01-14 14:59:12,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:12,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:12,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:12,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:12,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:12,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:12,681 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states. [2019-01-14 14:59:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:13,403 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions. [2019-01-14 14:59:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:13,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-14 14:59:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:13,411 INFO L225 Difference]: With dead ends: 350 [2019-01-14 14:59:13,411 INFO L226 Difference]: Without dead ends: 198 [2019-01-14 14:59:13,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-14 14:59:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-14 14:59:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-14 14:59:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions. [2019-01-14 14:59:13,448 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33 [2019-01-14 14:59:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:13,449 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions. [2019-01-14 14:59:13,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions. [2019-01-14 14:59:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 14:59:13,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:13,454 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] [2019-01-14 14:59:13,454 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:13,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:13,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times [2019-01-14 14:59:13,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:13,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:13,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:13,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:13,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:13,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:13,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:13,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:13,570 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states. [2019-01-14 14:59:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:13,935 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions. [2019-01-14 14:59:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:13,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 14:59:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:13,939 INFO L225 Difference]: With dead ends: 411 [2019-01-14 14:59:13,939 INFO L226 Difference]: Without dead ends: 231 [2019-01-14 14:59:13,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-14 14:59:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-01-14 14:59:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-14 14:59:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions. [2019-01-14 14:59:13,959 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39 [2019-01-14 14:59:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:13,960 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions. [2019-01-14 14:59:13,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions. [2019-01-14 14:59:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 14:59:13,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:13,962 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] [2019-01-14 14:59:13,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times [2019-01-14 14:59:13,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:13,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:14,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:14,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:14,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:14,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:14,056 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states. [2019-01-14 14:59:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:14,362 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions. [2019-01-14 14:59:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:14,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-14 14:59:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:14,365 INFO L225 Difference]: With dead ends: 460 [2019-01-14 14:59:14,365 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 14:59:14,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 14:59:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-01-14 14:59:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-14 14:59:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions. [2019-01-14 14:59:14,383 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40 [2019-01-14 14:59:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:14,384 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions. [2019-01-14 14:59:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions. [2019-01-14 14:59:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 14:59:14,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:14,388 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:59:14,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times [2019-01-14 14:59:14,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:14,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:14,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:14,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:14,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:14,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:14,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:14,491 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states. [2019-01-14 14:59:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:14,748 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions. [2019-01-14 14:59:14,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:14,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-01-14 14:59:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:14,751 INFO L225 Difference]: With dead ends: 504 [2019-01-14 14:59:14,751 INFO L226 Difference]: Without dead ends: 275 [2019-01-14 14:59:14,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-14 14:59:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-01-14 14:59:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-14 14:59:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions. [2019-01-14 14:59:14,778 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58 [2019-01-14 14:59:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:14,778 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions. [2019-01-14 14:59:14,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions. [2019-01-14 14:59:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 14:59:14,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:14,789 INFO L402 BasicCegarLoop]: trace histogram [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-14 14:59:14,790 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times [2019-01-14 14:59:14,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:14,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:14,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:14,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:14,882 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states. [2019-01-14 14:59:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:15,383 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions. [2019-01-14 14:59:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:15,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-14 14:59:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:15,387 INFO L225 Difference]: With dead ends: 529 [2019-01-14 14:59:15,387 INFO L226 Difference]: Without dead ends: 275 [2019-01-14 14:59:15,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-14 14:59:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-01-14 14:59:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-14 14:59:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2019-01-14 14:59:15,401 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59 [2019-01-14 14:59:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:15,402 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2019-01-14 14:59:15,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2019-01-14 14:59:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 14:59:15,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:15,405 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:59:15,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:15,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times [2019-01-14 14:59:15,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:15,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:15,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:15,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:15,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:15,495 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states. [2019-01-14 14:59:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:15,695 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-01-14 14:59:15,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:15,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-14 14:59:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:15,700 INFO L225 Difference]: With dead ends: 546 [2019-01-14 14:59:15,700 INFO L226 Difference]: Without dead ends: 292 [2019-01-14 14:59:15,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-14 14:59:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-01-14 14:59:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-14 14:59:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions. [2019-01-14 14:59:15,712 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60 [2019-01-14 14:59:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:15,713 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions. [2019-01-14 14:59:15,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions. [2019-01-14 14:59:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 14:59:15,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:15,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:15,716 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times [2019-01-14 14:59:15,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:15,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:15,788 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states. [2019-01-14 14:59:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:16,694 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-14 14:59:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:16,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-14 14:59:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:16,698 INFO L225 Difference]: With dead ends: 594 [2019-01-14 14:59:16,698 INFO L226 Difference]: Without dead ends: 309 [2019-01-14 14:59:16,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-14 14:59:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-01-14 14:59:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-14 14:59:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions. [2019-01-14 14:59:16,710 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72 [2019-01-14 14:59:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:16,710 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions. [2019-01-14 14:59:16,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions. [2019-01-14 14:59:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 14:59:16,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:16,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:16,714 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times [2019-01-14 14:59:16,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:16,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:16,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:16,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:16,812 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states. [2019-01-14 14:59:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:17,559 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions. [2019-01-14 14:59:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:17,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-14 14:59:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:17,565 INFO L225 Difference]: With dead ends: 645 [2019-01-14 14:59:17,565 INFO L226 Difference]: Without dead ends: 345 [2019-01-14 14:59:17,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-14 14:59:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-14 14:59:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 14:59:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions. [2019-01-14 14:59:17,584 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72 [2019-01-14 14:59:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:17,585 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions. [2019-01-14 14:59:17,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions. [2019-01-14 14:59:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 14:59:17,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:17,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:17,589 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times [2019-01-14 14:59:17,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:17,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:17,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:17,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:17,700 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states. [2019-01-14 14:59:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:17,976 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions. [2019-01-14 14:59:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:17,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-14 14:59:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:17,980 INFO L225 Difference]: With dead ends: 681 [2019-01-14 14:59:17,980 INFO L226 Difference]: Without dead ends: 345 [2019-01-14 14:59:17,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-14 14:59:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-14 14:59:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 14:59:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions. [2019-01-14 14:59:17,996 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73 [2019-01-14 14:59:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:17,996 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions. [2019-01-14 14:59:17,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions. [2019-01-14 14:59:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 14:59:17,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:17,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:17,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:18,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times [2019-01-14 14:59:18,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:18,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:18,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:18,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:18,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:18,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:18,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:18,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:18,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:18,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:18,090 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states. [2019-01-14 14:59:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:18,570 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions. [2019-01-14 14:59:18,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:18,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-14 14:59:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:18,573 INFO L225 Difference]: With dead ends: 681 [2019-01-14 14:59:18,573 INFO L226 Difference]: Without dead ends: 345 [2019-01-14 14:59:18,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-14 14:59:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-14 14:59:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 14:59:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-01-14 14:59:18,586 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73 [2019-01-14 14:59:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:18,587 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-01-14 14:59:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-01-14 14:59:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 14:59:18,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:18,590 INFO L402 BasicCegarLoop]: trace histogram [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-14 14:59:18,590 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:18,590 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times [2019-01-14 14:59:18,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:18,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:18,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 14:59:18,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:18,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:18,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:18,681 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states. [2019-01-14 14:59:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:19,447 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2019-01-14 14:59:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:19,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-14 14:59:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:19,452 INFO L225 Difference]: With dead ends: 708 [2019-01-14 14:59:19,452 INFO L226 Difference]: Without dead ends: 372 [2019-01-14 14:59:19,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-01-14 14:59:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-01-14 14:59:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-14 14:59:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions. [2019-01-14 14:59:19,467 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79 [2019-01-14 14:59:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:19,467 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions. [2019-01-14 14:59:19,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions. [2019-01-14 14:59:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-14 14:59:19,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:19,470 INFO L402 BasicCegarLoop]: trace histogram [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-14 14:59:19,471 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times [2019-01-14 14:59:19,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:19,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:19,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:19,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 14:59:19,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:19,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:19,525 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states. [2019-01-14 14:59:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:20,031 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions. [2019-01-14 14:59:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:20,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-14 14:59:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:20,035 INFO L225 Difference]: With dead ends: 732 [2019-01-14 14:59:20,036 INFO L226 Difference]: Without dead ends: 372 [2019-01-14 14:59:20,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-01-14 14:59:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-01-14 14:59:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-14 14:59:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions. [2019-01-14 14:59:20,048 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80 [2019-01-14 14:59:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:20,048 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions. [2019-01-14 14:59:20,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions. [2019-01-14 14:59:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 14:59:20,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:20,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:20,051 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times [2019-01-14 14:59:20,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:20,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-14 14:59:20,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:20,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:20,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:20,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:20,121 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states. [2019-01-14 14:59:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:20,448 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2019-01-14 14:59:20,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:20,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-14 14:59:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:20,452 INFO L225 Difference]: With dead ends: 736 [2019-01-14 14:59:20,452 INFO L226 Difference]: Without dead ends: 376 [2019-01-14 14:59:20,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-01-14 14:59:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-01-14 14:59:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-14 14:59:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2019-01-14 14:59:20,469 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85 [2019-01-14 14:59:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:20,469 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2019-01-14 14:59:20,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2019-01-14 14:59:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 14:59:20,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:20,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:20,473 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times [2019-01-14 14:59:20,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:20,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:20,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:20,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:20,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:20,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:20,563 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states. [2019-01-14 14:59:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:21,405 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions. [2019-01-14 14:59:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-14 14:59:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:21,409 INFO L225 Difference]: With dead ends: 776 [2019-01-14 14:59:21,409 INFO L226 Difference]: Without dead ends: 407 [2019-01-14 14:59:21,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-01-14 14:59:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-01-14 14:59:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-14 14:59:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions. [2019-01-14 14:59:21,427 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86 [2019-01-14 14:59:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:21,427 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions. [2019-01-14 14:59:21,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions. [2019-01-14 14:59:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-14 14:59:21,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:21,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:21,431 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times [2019-01-14 14:59:21,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:21,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:21,537 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states. [2019-01-14 14:59:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:21,804 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions. [2019-01-14 14:59:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:21,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-01-14 14:59:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:21,807 INFO L225 Difference]: With dead ends: 805 [2019-01-14 14:59:21,807 INFO L226 Difference]: Without dead ends: 407 [2019-01-14 14:59:21,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-01-14 14:59:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-01-14 14:59:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-14 14:59:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions. [2019-01-14 14:59:21,822 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87 [2019-01-14 14:59:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:21,822 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions. [2019-01-14 14:59:21,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions. [2019-01-14 14:59:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:59:21,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:21,826 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:59:21,826 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times [2019-01-14 14:59:21,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:21,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 14:59:21,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:21,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:21,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:21,905 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states. [2019-01-14 14:59:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:22,682 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions. [2019-01-14 14:59:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:22,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:59:22,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:22,686 INFO L225 Difference]: With dead ends: 828 [2019-01-14 14:59:22,687 INFO L226 Difference]: Without dead ends: 430 [2019-01-14 14:59:22,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-14 14:59:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-01-14 14:59:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-14 14:59:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions. [2019-01-14 14:59:22,705 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100 [2019-01-14 14:59:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:22,705 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions. [2019-01-14 14:59:22,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions. [2019-01-14 14:59:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 14:59:22,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:22,710 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:59:22,710 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times [2019-01-14 14:59:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:22,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 14:59:22,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:22,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:22,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:22,813 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states. [2019-01-14 14:59:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:23,170 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions. [2019-01-14 14:59:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:23,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-14 14:59:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:23,174 INFO L225 Difference]: With dead ends: 849 [2019-01-14 14:59:23,174 INFO L226 Difference]: Without dead ends: 430 [2019-01-14 14:59:23,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-14 14:59:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-01-14 14:59:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-14 14:59:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2019-01-14 14:59:23,189 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101 [2019-01-14 14:59:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:23,189 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2019-01-14 14:59:23,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2019-01-14 14:59:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 14:59:23,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:23,193 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, 1, 1, 1, 1] [2019-01-14 14:59:23,193 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times [2019-01-14 14:59:23,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:23,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:23,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:23,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:23,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,277 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states. [2019-01-14 14:59:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:23,463 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions. [2019-01-14 14:59:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:23,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-14 14:59:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:23,466 INFO L225 Difference]: With dead ends: 890 [2019-01-14 14:59:23,466 INFO L226 Difference]: Without dead ends: 471 [2019-01-14 14:59:23,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-01-14 14:59:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2019-01-14 14:59:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-01-14 14:59:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions. [2019-01-14 14:59:23,483 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102 [2019-01-14 14:59:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:23,483 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions. [2019-01-14 14:59:23,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions. [2019-01-14 14:59:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 14:59:23,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:23,487 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:23,487 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times [2019-01-14 14:59:23,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:23,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-14 14:59:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:23,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,561 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states. [2019-01-14 14:59:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:23,902 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions. [2019-01-14 14:59:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:23,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-14 14:59:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:23,906 INFO L225 Difference]: With dead ends: 965 [2019-01-14 14:59:23,906 INFO L226 Difference]: Without dead ends: 504 [2019-01-14 14:59:23,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-01-14 14:59:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-01-14 14:59:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-01-14 14:59:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions. [2019-01-14 14:59:23,922 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103 [2019-01-14 14:59:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:23,922 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions. [2019-01-14 14:59:23,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions. [2019-01-14 14:59:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 14:59:23,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:23,926 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, 1, 1, 1, 1, 1] [2019-01-14 14:59:23,926 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times [2019-01-14 14:59:23,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:23,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 14:59:23,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:23,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:23,978 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states. [2019-01-14 14:59:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:24,173 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions. [2019-01-14 14:59:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:24,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-14 14:59:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:24,179 INFO L225 Difference]: With dead ends: 1004 [2019-01-14 14:59:24,180 INFO L226 Difference]: Without dead ends: 507 [2019-01-14 14:59:24,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-01-14 14:59:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-01-14 14:59:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-14 14:59:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions. [2019-01-14 14:59:24,198 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103 [2019-01-14 14:59:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:24,198 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions. [2019-01-14 14:59:24,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions. [2019-01-14 14:59:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:59:24,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:24,201 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:24,202 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:24,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times [2019-01-14 14:59:24,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:24,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:24,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:24,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-14 14:59:24,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:24,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:24,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:24,283 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states. [2019-01-14 14:59:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:24,846 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions. [2019-01-14 14:59:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:24,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:59:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:24,851 INFO L225 Difference]: With dead ends: 1003 [2019-01-14 14:59:24,851 INFO L226 Difference]: Without dead ends: 506 [2019-01-14 14:59:24,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-01-14 14:59:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-01-14 14:59:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-14 14:59:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions. [2019-01-14 14:59:24,868 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104 [2019-01-14 14:59:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:24,868 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions. [2019-01-14 14:59:24,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions. [2019-01-14 14:59:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 14:59:24,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:24,872 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:24,872 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times [2019-01-14 14:59:24,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:24,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:24,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-01-14 14:59:24,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:24,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:24,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:24,967 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states. [2019-01-14 14:59:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:25,060 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions. [2019-01-14 14:59:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:25,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-14 14:59:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:25,068 INFO L225 Difference]: With dead ends: 1491 [2019-01-14 14:59:25,068 INFO L226 Difference]: Without dead ends: 994 [2019-01-14 14:59:25,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-01-14 14:59:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505. [2019-01-14 14:59:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-14 14:59:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2019-01-14 14:59:25,096 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116 [2019-01-14 14:59:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:25,097 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2019-01-14 14:59:25,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2019-01-14 14:59:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 14:59:25,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:25,101 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:25,101 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times [2019-01-14 14:59:25,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:25,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-14 14:59:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:25,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:25,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:25,228 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states. [2019-01-14 14:59:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:25,575 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions. [2019-01-14 14:59:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:25,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-14 14:59:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:25,582 INFO L225 Difference]: With dead ends: 1499 [2019-01-14 14:59:25,582 INFO L226 Difference]: Without dead ends: 1001 [2019-01-14 14:59:25,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-01-14 14:59:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-01-14 14:59:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-01-14 14:59:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions. [2019-01-14 14:59:25,622 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116 [2019-01-14 14:59:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:25,623 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions. [2019-01-14 14:59:25,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions. [2019-01-14 14:59:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-14 14:59:25,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:25,627 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:25,627 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times [2019-01-14 14:59:25,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-14 14:59:25,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:25,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:25,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:25,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:25,723 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states. [2019-01-14 14:59:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:26,115 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions. [2019-01-14 14:59:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:26,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-01-14 14:59:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:26,123 INFO L225 Difference]: With dead ends: 2493 [2019-01-14 14:59:26,124 INFO L226 Difference]: Without dead ends: 1499 [2019-01-14 14:59:26,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-01-14 14:59:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-01-14 14:59:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-01-14 14:59:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions. [2019-01-14 14:59:26,180 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118 [2019-01-14 14:59:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:26,180 INFO L480 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions. [2019-01-14 14:59:26,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions. [2019-01-14 14:59:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-14 14:59:26,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:26,184 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:26,184 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times [2019-01-14 14:59:26,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-01-14 14:59:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:26,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:26,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:26,283 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states. [2019-01-14 14:59:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:26,913 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions. [2019-01-14 14:59:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:26,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-01-14 14:59:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:26,927 INFO L225 Difference]: With dead ends: 1997 [2019-01-14 14:59:26,927 INFO L226 Difference]: Without dead ends: 1995 [2019-01-14 14:59:26,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-01-14 14:59:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2019-01-14 14:59:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-01-14 14:59:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions. [2019-01-14 14:59:27,027 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119 [2019-01-14 14:59:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:27,027 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions. [2019-01-14 14:59:27,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions. [2019-01-14 14:59:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-14 14:59:27,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:27,035 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:59:27,036 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times [2019-01-14 14:59:27,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:27,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:27,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:27,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:27,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-14 14:59:27,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:27,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:27,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:27,130 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states. [2019-01-14 14:59:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:28,332 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions. [2019-01-14 14:59:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:28,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-14 14:59:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:28,344 INFO L225 Difference]: With dead ends: 4167 [2019-01-14 14:59:28,344 INFO L226 Difference]: Without dead ends: 2181 [2019-01-14 14:59:28,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-01-14 14:59:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157. [2019-01-14 14:59:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-01-14 14:59:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions. [2019-01-14 14:59:28,423 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149 [2019-01-14 14:59:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:28,423 INFO L480 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions. [2019-01-14 14:59:28,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions. [2019-01-14 14:59:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-14 14:59:28,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:28,428 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:59:28,428 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times [2019-01-14 14:59:28,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:28,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:28,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-14 14:59:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:59:28,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:28,515 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states. [2019-01-14 14:59:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:29,390 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions. [2019-01-14 14:59:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:29,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-01-14 14:59:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:29,398 INFO L225 Difference]: With dead ends: 4331 [2019-01-14 14:59:29,398 INFO L226 Difference]: Without dead ends: 2149 [2019-01-14 14:59:29,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2019-01-14 14:59:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125. [2019-01-14 14:59:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-14 14:59:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions. [2019-01-14 14:59:29,495 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150 [2019-01-14 14:59:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:29,495 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions. [2019-01-14 14:59:29,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions. [2019-01-14 14:59:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 14:59:29,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:29,500 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:29,501 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times [2019-01-14 14:59:29,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-01-14 14:59:29,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:29,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:29,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:29,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-01-14 14:59:30,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:59:30,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:59:30,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:59:30,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:59:30,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:59:30,105 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 5 states. [2019-01-14 14:59:33,309 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 14:59:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:34,556 INFO L93 Difference]: Finished difference Result 7438 states and 10941 transitions. [2019-01-14 14:59:34,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:59:34,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-01-14 14:59:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:34,584 INFO L225 Difference]: With dead ends: 7438 [2019-01-14 14:59:34,584 INFO L226 Difference]: Without dead ends: 5255 [2019-01-14 14:59:34,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:59:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2019-01-14 14:59:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 2974. [2019-01-14 14:59:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-01-14 14:59:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4315 transitions. [2019-01-14 14:59:34,770 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4315 transitions. Word has length 182 [2019-01-14 14:59:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:34,770 INFO L480 AbstractCegarLoop]: Abstraction has 2974 states and 4315 transitions. [2019-01-14 14:59:34,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:59:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4315 transitions. [2019-01-14 14:59:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-14 14:59:34,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:34,783 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:34,783 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times [2019-01-14 14:59:34,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:34,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-14 14:59:34,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:34,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:34,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,932 INFO L87 Difference]: Start difference. First operand 2974 states and 4315 transitions. Second operand 3 states. [2019-01-14 14:59:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:35,600 INFO L93 Difference]: Finished difference Result 4755 states and 6900 transitions. [2019-01-14 14:59:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:35,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-14 14:59:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:35,640 INFO L225 Difference]: With dead ends: 4755 [2019-01-14 14:59:35,640 INFO L226 Difference]: Without dead ends: 3567 [2019-01-14 14:59:35,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2019-01-14 14:59:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3567. [2019-01-14 14:59:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-14 14:59:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 5178 transitions. [2019-01-14 14:59:35,821 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 5178 transitions. Word has length 186 [2019-01-14 14:59:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 5178 transitions. [2019-01-14 14:59:35,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 5178 transitions. [2019-01-14 14:59:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-14 14:59:35,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:35,831 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, 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] [2019-01-14 14:59:35,832 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:35,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times [2019-01-14 14:59:35,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-01-14 14:59:35,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:35,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:35,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:35,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:35,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,955 INFO L87 Difference]: Start difference. First operand 3567 states and 5178 transitions. Second operand 3 states. [2019-01-14 14:59:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:36,360 INFO L93 Difference]: Finished difference Result 7187 states and 10417 transitions. [2019-01-14 14:59:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:36,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-01-14 14:59:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:36,370 INFO L225 Difference]: With dead ends: 7187 [2019-01-14 14:59:36,370 INFO L226 Difference]: Without dead ends: 3627 [2019-01-14 14:59:36,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2019-01-14 14:59:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3567. [2019-01-14 14:59:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-14 14:59:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 5130 transitions. [2019-01-14 14:59:36,503 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 5130 transitions. Word has length 264 [2019-01-14 14:59:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:36,504 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 5130 transitions. [2019-01-14 14:59:36,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 5130 transitions. [2019-01-14 14:59:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-14 14:59:36,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:36,513 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:36,513 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times [2019-01-14 14:59:36,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:36,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-14 14:59:36,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:36,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:36,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:36,625 INFO L87 Difference]: Start difference. First operand 3567 states and 5130 transitions. Second operand 3 states. [2019-01-14 14:59:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:37,475 INFO L93 Difference]: Finished difference Result 7217 states and 10351 transitions. [2019-01-14 14:59:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:37,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-01-14 14:59:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:37,485 INFO L225 Difference]: With dead ends: 7217 [2019-01-14 14:59:37,485 INFO L226 Difference]: Without dead ends: 3657 [2019-01-14 14:59:37,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-14 14:59:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3567. [2019-01-14 14:59:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-14 14:59:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4914 transitions. [2019-01-14 14:59:37,612 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4914 transitions. Word has length 268 [2019-01-14 14:59:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:37,613 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 4914 transitions. [2019-01-14 14:59:37,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4914 transitions. [2019-01-14 14:59:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-01-14 14:59:37,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:37,621 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-01-14 14:59:37,622 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times [2019-01-14 14:59:37,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:37,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-01-14 14:59:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:37,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:37,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:37,777 INFO L87 Difference]: Start difference. First operand 3567 states and 4914 transitions. Second operand 3 states. [2019-01-14 14:59:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,161 INFO L93 Difference]: Finished difference Result 7217 states and 9927 transitions. [2019-01-14 14:59:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-01-14 14:59:39,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,169 INFO L225 Difference]: With dead ends: 7217 [2019-01-14 14:59:39,170 INFO L226 Difference]: Without dead ends: 3657 [2019-01-14 14:59:39,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-14 14:59:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3567. [2019-01-14 14:59:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-14 14:59:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4854 transitions. [2019-01-14 14:59:39,336 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4854 transitions. Word has length 278 [2019-01-14 14:59:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,337 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 4854 transitions. [2019-01-14 14:59:39,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4854 transitions. [2019-01-14 14:59:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-14 14:59:39,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,349 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:39,349 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2088848437, now seen corresponding path program 1 times [2019-01-14 14:59:39,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-14 14:59:39,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,492 INFO L87 Difference]: Start difference. First operand 3567 states and 4854 transitions. Second operand 3 states. [2019-01-14 14:59:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,105 INFO L93 Difference]: Finished difference Result 7385 states and 10039 transitions. [2019-01-14 14:59:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-01-14 14:59:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,113 INFO L225 Difference]: With dead ends: 7385 [2019-01-14 14:59:40,113 INFO L226 Difference]: Without dead ends: 3717 [2019-01-14 14:59:40,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2019-01-14 14:59:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3657. [2019-01-14 14:59:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2019-01-14 14:59:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4926 transitions. [2019-01-14 14:59:40,247 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4926 transitions. Word has length 297 [2019-01-14 14:59:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,247 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 4926 transitions. [2019-01-14 14:59:40,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4926 transitions. [2019-01-14 14:59:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-14 14:59:40,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,256 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 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] [2019-01-14 14:59:40,256 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times [2019-01-14 14:59:40,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-01-14 14:59:40,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:40,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:40,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-01-14 14:59:40,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:59:40,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:59:40,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:59:40,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:59:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:59:40,914 INFO L87 Difference]: Start difference. First operand 3657 states and 4926 transitions. Second operand 4 states. [2019-01-14 14:59:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,866 INFO L93 Difference]: Finished difference Result 8564 states and 11406 transitions. [2019-01-14 14:59:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:59:41,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-01-14 14:59:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,880 INFO L225 Difference]: With dead ends: 8564 [2019-01-14 14:59:41,880 INFO L226 Difference]: Without dead ends: 4884 [2019-01-14 14:59:41,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 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-14 14:59:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2019-01-14 14:59:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 3471. [2019-01-14 14:59:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-01-14 14:59:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4626 transitions. [2019-01-14 14:59:42,038 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4626 transitions. Word has length 297 [2019-01-14 14:59:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,039 INFO L480 AbstractCegarLoop]: Abstraction has 3471 states and 4626 transitions. [2019-01-14 14:59:42,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:59:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4626 transitions. [2019-01-14 14:59:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-14 14:59:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,051 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:42,051 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -559976568, now seen corresponding path program 1 times [2019-01-14 14:59:42,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-01-14 14:59:42,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,196 INFO L87 Difference]: Start difference. First operand 3471 states and 4626 transitions. Second operand 3 states. [2019-01-14 14:59:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:42,455 INFO L93 Difference]: Finished difference Result 6991 states and 9327 transitions. [2019-01-14 14:59:42,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:42,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-01-14 14:59:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:42,460 INFO L225 Difference]: With dead ends: 6991 [2019-01-14 14:59:42,460 INFO L226 Difference]: Without dead ends: 3527 [2019-01-14 14:59:42,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-01-14 14:59:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3471. [2019-01-14 14:59:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-01-14 14:59:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4620 transitions. [2019-01-14 14:59:42,620 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4620 transitions. Word has length 298 [2019-01-14 14:59:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,620 INFO L480 AbstractCegarLoop]: Abstraction has 3471 states and 4620 transitions. [2019-01-14 14:59:42,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4620 transitions. [2019-01-14 14:59:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-01-14 14:59:42,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,629 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:42,629 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash -50095736, now seen corresponding path program 1 times [2019-01-14 14:59:42,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 687 proven. 16 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-14 14:59:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:42,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:42,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:43,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-01-14 14:59:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:59:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:59:43,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:59:43,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:59:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:59:43,267 INFO L87 Difference]: Start difference. First operand 3471 states and 4620 transitions. Second operand 5 states. [2019-01-14 14:59:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,038 INFO L93 Difference]: Finished difference Result 10969 states and 14359 transitions. [2019-01-14 14:59:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:59:45,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 309 [2019-01-14 14:59:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,046 INFO L225 Difference]: With dead ends: 10969 [2019-01-14 14:59:45,046 INFO L226 Difference]: Without dead ends: 7505 [2019-01-14 14:59:45,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:59:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-14 14:59:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 4467. [2019-01-14 14:59:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-01-14 14:59:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5723 transitions. [2019-01-14 14:59:45,262 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5723 transitions. Word has length 309 [2019-01-14 14:59:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,262 INFO L480 AbstractCegarLoop]: Abstraction has 4467 states and 5723 transitions. [2019-01-14 14:59:45,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:59:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5723 transitions. [2019-01-14 14:59:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-14 14:59:45,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,272 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:45,273 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times [2019-01-14 14:59:45,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-01-14 14:59:45,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,473 INFO L87 Difference]: Start difference. First operand 4467 states and 5723 transitions. Second operand 3 states. [2019-01-14 14:59:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,786 INFO L93 Difference]: Finished difference Result 9002 states and 11510 transitions. [2019-01-14 14:59:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-14 14:59:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,792 INFO L225 Difference]: With dead ends: 9002 [2019-01-14 14:59:45,793 INFO L226 Difference]: Without dead ends: 4542 [2019-01-14 14:59:45,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2019-01-14 14:59:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4467. [2019-01-14 14:59:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-01-14 14:59:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5633 transitions. [2019-01-14 14:59:45,990 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5633 transitions. Word has length 321 [2019-01-14 14:59:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,990 INFO L480 AbstractCegarLoop]: Abstraction has 4467 states and 5633 transitions. [2019-01-14 14:59:45,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5633 transitions. [2019-01-14 14:59:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-14 14:59:45,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,996 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 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, 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] [2019-01-14 14:59:45,996 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 8891195, now seen corresponding path program 1 times [2019-01-14 14:59:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 926 proven. 26 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-01-14 14:59:46,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:46,208 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-01-14 14:59:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:59:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:59:46,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:59:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:59:46,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:59:46,443 INFO L87 Difference]: Start difference. First operand 4467 states and 5633 transitions. Second operand 5 states. [2019-01-14 14:59:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,366 INFO L93 Difference]: Finished difference Result 12027 states and 15128 transitions. [2019-01-14 14:59:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 14:59:47,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-01-14 14:59:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,375 INFO L225 Difference]: With dead ends: 12027 [2019-01-14 14:59:47,376 INFO L226 Difference]: Without dead ends: 7567 [2019-01-14 14:59:47,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:59:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-01-14 14:59:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 4527. [2019-01-14 14:59:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-01-14 14:59:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 5636 transitions. [2019-01-14 14:59:47,555 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 5636 transitions. Word has length 364 [2019-01-14 14:59:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:47,555 INFO L480 AbstractCegarLoop]: Abstraction has 4527 states and 5636 transitions. [2019-01-14 14:59:47,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:59:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5636 transitions. [2019-01-14 14:59:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-01-14 14:59:47,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:47,562 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:47,562 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times [2019-01-14 14:59:47,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-14 14:59:47,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,699 INFO L87 Difference]: Start difference. First operand 4527 states and 5636 transitions. Second operand 3 states. [2019-01-14 14:59:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,977 INFO L93 Difference]: Finished difference Result 7997 states and 9987 transitions. [2019-01-14 14:59:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-01-14 14:59:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,983 INFO L225 Difference]: With dead ends: 7997 [2019-01-14 14:59:47,983 INFO L226 Difference]: Without dead ends: 4539 [2019-01-14 14:59:47,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2019-01-14 14:59:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4527. [2019-01-14 14:59:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-01-14 14:59:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 5630 transitions. [2019-01-14 14:59:48,111 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 5630 transitions. Word has length 387 [2019-01-14 14:59:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,111 INFO L480 AbstractCegarLoop]: Abstraction has 4527 states and 5630 transitions. [2019-01-14 14:59:48,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5630 transitions. [2019-01-14 14:59:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-01-14 14:59:48,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,117 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 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, 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-14 14:59:48,117 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times [2019-01-14 14:59:48,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-01-14 14:59:48,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:48,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:48,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,266 INFO L87 Difference]: Start difference. First operand 4527 states and 5630 transitions. Second operand 3 states. [2019-01-14 14:59:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:48,788 INFO L93 Difference]: Finished difference Result 8462 states and 10531 transitions. [2019-01-14 14:59:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:48,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-01-14 14:59:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:48,792 INFO L225 Difference]: With dead ends: 8462 [2019-01-14 14:59:48,792 INFO L226 Difference]: Without dead ends: 3821 [2019-01-14 14:59:48,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-01-14 14:59:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3732. [2019-01-14 14:59:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-14 14:59:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 4603 transitions. [2019-01-14 14:59:48,895 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 4603 transitions. Word has length 387 [2019-01-14 14:59:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 4603 transitions. [2019-01-14 14:59:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 4603 transitions. [2019-01-14 14:59:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-14 14:59:48,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,902 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, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:48,902 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times [2019-01-14 14:59:48,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-01-14 14:59:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:49,113 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:49,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-01-14 14:59:49,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:59:49,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:59:49,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:59:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:59:49,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:59:49,302 INFO L87 Difference]: Start difference. First operand 3732 states and 4603 transitions. Second operand 4 states. [2019-01-14 14:59:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:49,552 INFO L93 Difference]: Finished difference Result 5758 states and 7115 transitions. [2019-01-14 14:59:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 14:59:49,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-01-14 14:59:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:49,553 INFO L225 Difference]: With dead ends: 5758 [2019-01-14 14:59:49,553 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:59:49,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 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-14 14:59:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:59:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:59:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:59:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:59:49,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2019-01-14 14:59:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:59:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:59:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:59:49,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:59:49,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:59:49,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,743 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 138 [2019-01-14 14:59:49,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:49,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,039 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 139 [2019-01-14 14:59:50,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,237 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 117 [2019-01-14 14:59:50,455 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 190 [2019-01-14 14:59:50,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:50,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:51,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,467 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 673 DAG size of output: 453 [2019-01-14 14:59:52,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:52,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,945 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 675 DAG size of output: 455 [2019-01-14 14:59:53,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:53,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:55,096 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 134 DAG size of output: 59 [2019-01-14 14:59:55,523 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 30 [2019-01-14 14:59:55,941 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-01-14 14:59:56,817 WARN L181 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2019-01-14 14:59:57,367 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-14 14:59:57,873 WARN L181 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 25 [2019-01-14 14:59:58,770 WARN L181 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 38 [2019-01-14 14:59:59,295 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-14 14:59:59,714 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-01-14 15:00:00,131 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 28 [2019-01-14 15:00:06,815 WARN L181 SmtUtils]: Spent 6.68 s on a formula simplification. DAG size of input: 388 DAG size of output: 113 [2019-01-14 15:00:07,251 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-01-14 15:00:07,944 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 70 [2019-01-14 15:00:08,645 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-14 15:00:09,141 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 51 [2019-01-14 15:00:15,576 WARN L181 SmtUtils]: Spent 6.43 s on a formula simplification. DAG size of input: 390 DAG size of output: 116 [2019-01-14 15:00:16,162 WARN L181 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 33 [2019-01-14 15:00:16,771 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-01-14 15:00:17,698 WARN L181 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 38 [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 611) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 562) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 573) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 584) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 595) no Hoare annotation was computed. [2019-01-14 15:00:17,702 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 603) no Hoare annotation was computed. [2019-01-14 15:00:17,703 INFO L448 ceAbstractionStarter]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2019-01-14 15:00:17,705 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-14 15:00:17,705 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 563) the Hoare annotation is: (let ((.cse3 (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))))) (let ((.cse1 (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse1) (and (and .cse0 .cse1) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2) (and (and .cse0 (and (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3)) .cse2)))) [2019-01-14 15:00:17,705 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 595) the Hoare annotation is: false [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 503) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 602) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 561) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 572) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 583) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 594) no Hoare annotation was computed. [2019-01-14 15:00:17,706 INFO L444 ceAbstractionStarter]: At program point L403(lines 394 415) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) .cse3) .cse4) (and (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) .cse3) .cse4))) [2019-01-14 15:00:17,707 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-01-14 15:00:17,707 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-01-14 15:00:17,707 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-01-14 15:00:17,707 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 561) the Hoare annotation is: (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 15:00:17,707 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 573) the Hoare annotation is: (let ((.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 15:00:17,707 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 584) the Hoare annotation is: (let ((.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-01-14 15:00:17,707 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 540) no Hoare annotation was computed. [2019-01-14 15:00:17,707 INFO L448 ceAbstractionStarter]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2019-01-14 15:00:17,708 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-01-14 15:00:17,710 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 561) the Hoare annotation is: (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 15:00:17,710 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 571) no Hoare annotation was computed. [2019-01-14 15:00:17,710 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 582) no Hoare annotation was computed. [2019-01-14 15:00:17,710 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 593) no Hoare annotation was computed. [2019-01-14 15:00:17,710 INFO L451 ceAbstractionStarter]: At program point L637(lines 628 639) the Hoare annotation is: true [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 515) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 570) no Hoare annotation was computed. [2019-01-14 15:00:17,711 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 581) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 592) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 514) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 411) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-14 15:00:17,712 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 594) the Hoare annotation is: false [2019-01-14 15:00:17,712 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 571) the Hoare annotation is: (let ((.cse1 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 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 (= 8513 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)))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1) .cse2)) (and (and (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) .cse2) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 15:00:17,712 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 582) the Hoare annotation is: (let ((.cse7 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 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))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12) .cse8)))) [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 569) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 580) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 591) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 552) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2019-01-14 15:00:17,713 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 568) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 579) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 590) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 569) the Hoare annotation is: (let ((.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse4 (and .cse3 (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2)) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 15:00:17,714 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 580) the Hoare annotation is: (let ((.cse8 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse8 (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) .cse9)))) [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-14 15:00:17,714 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-01-14 15:00:17,715 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L451 ceAbstractionStarter]: At program point L615(lines 98 616) the Hoare annotation is: true [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 567) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 578) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 589) no Hoare annotation was computed. [2019-01-14 15:00:17,716 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 590) the Hoare annotation is: false [2019-01-14 15:00:17,717 INFO L444 ceAbstractionStarter]: At program point L485(lines 72 626) the Hoare annotation is: false [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L452(lines 452 461) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,717 INFO L444 ceAbstractionStarter]: At program point L354(lines 330 375) the Hoare annotation is: (let ((.cse8 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse8 (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12) .cse9)))) [2019-01-14 15:00:17,717 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 566) no Hoare annotation was computed. [2019-01-14 15:00:17,718 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 577) no Hoare annotation was computed. [2019-01-14 15:00:17,718 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 588) no Hoare annotation was computed. [2019-01-14 15:00:17,719 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-14 15:00:17,719 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 626) no Hoare annotation was computed. [2019-01-14 15:00:17,719 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 489) no Hoare annotation was computed. [2019-01-14 15:00:17,719 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:17,719 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 567) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse4) (and .cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0)) (and .cse0 .cse1 .cse3 .cse2 .cse4))) [2019-01-14 15:00:17,719 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 578) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) .cse3) .cse4) (and (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) .cse3) .cse4))) [2019-01-14 15:00:17,720 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 588) the Hoare annotation is: (let ((.cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 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))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14) (and .cse9 (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14) .cse10)) (and .cse9 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14)))) [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 622) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 524) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 565) no Hoare annotation was computed. [2019-01-14 15:00:17,720 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 576) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 587) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 494) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L490-2(lines 490 494) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L444 ceAbstractionStarter]: At program point L391(lines 382 417) the Hoare annotation is: (let ((.cse0 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) .cse3) .cse4) (and (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) .cse3) .cse4))) [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-14 15:00:17,721 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 564) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 575) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 586) no Hoare annotation was computed. [2019-01-14 15:00:17,722 INFO L451 ceAbstractionStarter]: At program point L625(lines 11 627) the Hoare annotation is: true [2019-01-14 15:00:17,723 INFO L444 ceAbstractionStarter]: At program point L559(lines 99 614) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse26 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse18 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8529 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))) (.cse24 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse17 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse12 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse7 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse15 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse3 .cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9) .cse2) (and .cse10 .cse11) (and (and .cse11 .cse12 .cse13 .cse14) .cse15) (and .cse16 .cse14 .cse17) (and .cse11 .cse18 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse19 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse20 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse21 .cse22 .cse23 .cse8 .cse9 .cse24) (and .cse0 .cse1 .cse6 .cse7 .cse2 .cse25 .cse26) (and .cse0 .cse1 .cse27 .cse17 .cse28) (and .cse11 .cse0 .cse1 .cse2 .cse25 .cse26) (and .cse10 .cse2 .cse28) (and .cse12 .cse13 .cse15 .cse14 .cse17 .cse2 .cse28) (and .cse10 (and (and .cse6 .cse7) .cse2)) (and .cse11 .cse3 .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse22 (and (and .cse18 .cse19 .cse20 .cse21 .cse6 .cse7 .cse23 .cse8 .cse9 .cse24) .cse2)) (and .cse22 (and (and .cse11 .cse18 .cse19 .cse20 .cse21 .cse23 .cse8 .cse9 .cse24) .cse2)) (and .cse10 .cse27 .cse17 .cse28) (and .cse16 .cse14 .cse2 .cse28) (and (and .cse14 .cse16 .cse7) .cse2) (and .cse27 .cse17 .cse28 .cse5 .cse15) (and (and (and .cse12 .cse13 .cse14 .cse6 .cse7) .cse2) .cse15))) [2019-01-14 15:00:17,723 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-01-14 15:00:17,724 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-01-14 15:00:17,724 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 565) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (and .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) .cse5) (and (and (and .cse0 (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0))) .cse4) .cse5) (and .cse5 (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3))))) [2019-01-14 15:00:17,725 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 576) the Hoare annotation is: (let ((.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3)) .cse4) (and (and (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) .cse0) .cse4))) [2019-01-14 15:00:17,725 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-01-14 15:00:17,725 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 563) no Hoare annotation was computed. [2019-01-14 15:00:17,725 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 574) no Hoare annotation was computed. [2019-01-14 15:00:17,725 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 585) no Hoare annotation was computed. [2019-01-14 15:00:17,725 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 614) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse26 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8529 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))) (.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse23 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse28 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse19 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse7 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse3 .cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9) .cse2) (and (and .cse10 .cse11 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse13 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse14 .cse15 .cse16 .cse8 .cse9 .cse17) .cse0) (and .cse18 .cse10) (and (and .cse10 .cse19 .cse20 .cse21) .cse22) (and .cse23 .cse21 .cse24) (and .cse0 .cse1 .cse6 .cse7 .cse2 .cse25 .cse26) (and .cse0 .cse1 .cse27 .cse24 .cse28) (and .cse10 .cse0 .cse1 .cse2 .cse25 .cse26) (and .cse18 .cse2 .cse28) (and .cse19 .cse20 .cse22 .cse21 .cse24 .cse2 .cse28) (and .cse18 (and (and .cse6 .cse7) .cse2)) (and .cse10 .cse3 .cse4 .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0) (and (and .cse11 .cse12 .cse13 .cse14 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17) .cse2)) (and .cse0 (and (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse8 .cse9 .cse17) .cse2)) (and .cse18 .cse27 .cse24 .cse28) (and .cse23 .cse21 .cse2 .cse28) (and (and .cse21 .cse23 .cse7) .cse2) (and .cse27 .cse24 .cse28 .cse5 .cse22) (and (and (and .cse19 .cse20 .cse21 .cse6 .cse7) .cse2) .cse22))) [2019-01-14 15:00:17,726 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 531) no Hoare annotation was computed. [2019-01-14 15:00:17,733 INFO L448 ceAbstractionStarter]: For program point L529-2(lines 208 558) no Hoare annotation was computed. [2019-01-14 15:00:17,733 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-14 15:00:17,733 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 574) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4))) [2019-01-14 15:00:17,734 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 587) the Hoare annotation is: (let ((.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 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))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and .cse14 (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 .cse10 .cse11 .cse12 .cse13) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-14 15:00:17,734 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-14 15:00:17,734 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 612) no Hoare annotation was computed. [2019-01-14 15:00:17,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:17 BoogieIcfgContainer [2019-01-14 15:00:17,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:17,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:17,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:17,812 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:17,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:11" (3/4) ... [2019-01-14 15:00:17,820 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:17,852 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 15:00:17,853 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:18,039 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:18,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:18,040 INFO L168 Benchmark]: Toolchain (without parser) took 68560.80 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 952.7 MB in the beginning and 1.9 GB in the end (delta: -946.0 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,041 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:18,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,043 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,044 INFO L168 Benchmark]: RCFGBuilder took 1287.83 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.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,047 INFO L168 Benchmark]: TraceAbstraction took 66426.59 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 999.8 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -828.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-14 15:00:18,048 INFO L168 Benchmark]: Witness Printer took 227.22 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:18,053 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.54 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1287.83 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.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66426.59 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 999.8 MB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -828.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 227.22 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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: 126]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state) || (8448 <= s__state && (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((((8448 <= s__state && s__state <= 8448) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8466 <= s__state) && 0 == s__hit) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (8466 <= s__state && ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8466 <= s__state) && 0 == s__hit) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) || (8466 <= s__state && ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit)) || (8466 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8560 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) || ((((((!(8560 == s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((s__state <= 8640 && 8640 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) || ((((s__state <= 8640 && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (8640 <= s__state && blastFlag <= 2 && s__state <= 8640)) || ((((s__state <= 8640 && 8640 <= s__state) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 4) && ((!(8656 == s__state) && !(8657 == s__state)) && blastFlag <= 6) && (!(8640 == s__state) && !(12292 == s__state)) && !(8641 == s__state)) || (((8672 <= s__state && ((!(8656 == s__state) && !(8657 == s__state)) && blastFlag <= 6) && (!(8640 == s__state) && !(12292 == s__state)) && !(8641 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit)) || ((8672 <= s__state && 6 <= blastFlag && (!(8640 == s__state) && !(12292 == s__state)) && !(8641 == s__state)) && 0 == s__hit) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8560 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) || ((((((!(8560 == s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8466 <= s__state) && 0 == s__hit) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (8466 <= s__state && ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8593 == s__state)) && !(8640 == s__state)) && !(8592 == s__state)) && s__state <= 8640) && 8576 <= s__state) || ((8576 <= s__state && s__state <= 8640 && (((!(8593 == s__state) && blastFlag <= 7) && !(8640 == s__state)) && 6 <= blastFlag) && !(8592 == s__state)) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) || ((((((((!(8609 == s__state) && !(8593 == s__state)) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && !(8545 == s__state)) && 0 == s__hit)) || (s__state <= 3 && blastFlag <= 2)) || ((((blastFlag <= 2 && !(8657 == s__state)) && !(8641 == s__state)) && s__state <= 8672) && 8640 <= s__state)) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || (((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8466 <= s__state) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((8448 <= s__state && s__state <= 8448) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((((((!(8657 == s__state) && !(8641 == s__state)) && 8640 <= s__state) && s__state <= 8672) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((blastFlag <= 2 && !(8609 == s__state)) && !(8593 == s__state)) && s__state <= 8640) && 8576 <= s__state)) || (8466 <= s__state && (((((((((!(8497 == s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit)) || (8466 <= s__state && ((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(8657 == s__state) && !(8641 == s__state)) && s__state <= 8672) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8544 == s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8466 <= s__state) && 0 == s__hit) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (8466 <= s__state && ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (8576 <= s__state && (blastFlag <= 2 && ((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8640) || ((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8640) && 8576 <= s__state) && 0 == s__hit) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8560 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) || ((((((!(8560 == s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (8466 <= s__state && ((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) || (8466 <= s__state && ((((((((((blastFlag <= 2 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) || ((((((((!(8609 == s__state) && !(8593 == s__state)) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(8561 == s__state)) && !(8545 == s__state)) && 0 == s__hit)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || (s__state <= 3 && blastFlag <= 2)) || ((((blastFlag <= 2 && !(8657 == s__state)) && !(8641 == s__state)) && s__state <= 8672) && 8640 <= s__state)) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || ((((((8448 <= s__state && s__state <= 8448) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((((((!(8657 == s__state) && !(8641 == s__state)) && 8640 <= s__state) && s__state <= 8672) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((blastFlag <= 2 && !(8609 == s__state)) && !(8593 == s__state)) && s__state <= 8640) && 8576 <= s__state)) || (8466 <= s__state && (((((((((!(8497 == s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && blastFlag <= 7) && 6 <= blastFlag) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit)) || (8448 <= s__state && (((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && 8672 <= s__state) && 6 <= blastFlag) && 0 == s__hit)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(8657 == s__state) && !(8641 == s__state)) && s__state <= 8672) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (8576 <= s__state && (((((blastFlag <= 2 && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8592 == s__state)) && s__state <= 8640) && !(8608 == s__state)) || (((((((((!(8609 == s__state) && !(8593 == s__state)) && !(8640 == s__state)) && !(8592 == s__state)) && s__state <= 8640) && blastFlag <= 7) && 8576 <= s__state) && 6 <= blastFlag) && !(8608 == s__state)) && 0 == s__hit) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8544 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((8544 <= s__state && ((blastFlag <= 2 && !(8544 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 0 == s__hit) || ((((((!(8544 == s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(8545 == s__state)) && s__state <= 8576) && 8544 <= s__state) && 0 == s__hit) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && (!(8640 == s__state) && !(8672 == s__state)) && !(8641 == s__state)) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && 0 == s__hit) && 8640 <= s__state) || (((s__state <= 8672 && (((blastFlag <= 7 && !(8640 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (8640 <= s__state && s__state <= 8672 && ((blastFlag <= 2 && !(8640 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. SAFE Result, 66.2s OverallTime, 42 OverallIterations, 14 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 28.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 7896 SDtfs, 6476 SDslu, 4190 SDs, 0 SdLazy, 5161 SolverSat, 1494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4527occurred in iteration=39, 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: 2.7s AutomataMinimizationTime, 42 MinimizatonAttempts, 10947 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 258 NumberOfFragments, 2449 HoareAnnotationTreeSize, 28 FomulaSimplifications, 646920 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 274733 FormulaSimplificationTreeSizeReductionInter, 23.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 8241 NumberOfCodeBlocks, 8241 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8194 ConstructedInterpolants, 0 QuantifiedInterpolants, 2776941 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 47 InterpolantComputations, 40 PerfectInterpolantSequences, 21019/21183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...