./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-11 21:24:01,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:24:01,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:24:01,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:24:01,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:24:01,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:24:01,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:24:01,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:24:01,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:24:01,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:24:01,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:24:01,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:24:01,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:24:01,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:24:01,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:24:01,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:24:01,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:24:01,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:24:01,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:24:01,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:24:01,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:24:01,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:24:01,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:24:01,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:24:01,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:24:01,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:24:01,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:24:01,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:24:01,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:24:01,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:24:01,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:24:01,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:24:01,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:24:01,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:24:01,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:24:01,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:24:01,382 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:24:01,405 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:24:01,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:24:01,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:24:01,409 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:24:01,409 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:24:01,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:24:01,409 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:24:01,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:24:01,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:24:01,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:24:01,412 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:24:01,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:24:01,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:24:01,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:24:01,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:24:01,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:24:01,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:24:01,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:24:01,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:24:01,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:24:01,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:24:01,415 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:24:01,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:24:01,416 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-11 21:24:01,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:24:01,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:24:01,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:24:01,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:24:01,492 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:24:01,493 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-11 21:24:01,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c994ad27c/a75bedc7860b4fb69fabe6e0709d39a9/FLAGad88d44c0 [2019-01-11 21:24:02,020 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:24:02,021 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_7_true-unreach-call_false-termination.cil.c [2019-01-11 21:24:02,033 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c994ad27c/a75bedc7860b4fb69fabe6e0709d39a9/FLAGad88d44c0 [2019-01-11 21:24:02,345 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c994ad27c/a75bedc7860b4fb69fabe6e0709d39a9 [2019-01-11 21:24:02,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:24:02,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:24:02,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:02,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:24:02,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:24:02,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a5c147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02, skipping insertion in model container [2019-01-11 21:24:02,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:24:02,423 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:24:02,711 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:02,716 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:24:02,775 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:02,796 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:24:02,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02 WrapperNode [2019-01-11 21:24:02,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:02,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:02,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:24:02,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:24:02,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:02,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:24:02,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:24:02,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:24:02,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... [2019-01-11 21:24:02,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:24:02,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:24:02,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:24:02,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:24:02,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:24:03,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:24:03,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:24:03,204 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:24:04,263 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:24:04,263 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:24:04,265 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:24:04,265 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:24:04,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:04 BoogieIcfgContainer [2019-01-11 21:24:04,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:24:04,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:24:04,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:24:04,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:24:04,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:24:02" (1/3) ... [2019-01-11 21:24:04,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333c40fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:04, skipping insertion in model container [2019-01-11 21:24:04,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:02" (2/3) ... [2019-01-11 21:24:04,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333c40fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:04, skipping insertion in model container [2019-01-11 21:24:04,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:04" (3/3) ... [2019-01-11 21:24:04,275 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7_true-unreach-call_false-termination.cil.c [2019-01-11 21:24:04,285 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:24:04,294 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:24:04,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:24:04,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:24:04,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:24:04,360 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:24:04,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:24:04,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:24:04,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:24:04,361 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:24:04,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:24:04,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:24:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-01-11 21:24:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:24:04,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:04,390 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-11 21:24:04,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times [2019-01-11 21:24:04,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:04,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:04,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:04,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:04,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:04,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:04,674 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-01-11 21:24:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:05,513 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2019-01-11 21:24:05,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:05,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-11 21:24:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:05,531 INFO L225 Difference]: With dead ends: 328 [2019-01-11 21:24:05,532 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 21:24:05,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-11 21:24:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 21:24:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2019-01-11 21:24:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-11 21:24:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2019-01-11 21:24:05,592 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32 [2019-01-11 21:24:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2019-01-11 21:24:05,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2019-01-11 21:24:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:24:05,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:05,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-11 21:24:05,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times [2019-01-11 21:24:05,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:05,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:05,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:05,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:05,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:05,686 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states. [2019-01-11 21:24:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:06,394 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions. [2019-01-11 21:24:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:06,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-11 21:24:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:06,400 INFO L225 Difference]: With dead ends: 350 [2019-01-11 21:24:06,401 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 21:24:06,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 21:24:06,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-11 21:24:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 21:24:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions. [2019-01-11 21:24:06,425 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33 [2019-01-11 21:24:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:06,425 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions. [2019-01-11 21:24:06,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions. [2019-01-11 21:24:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 21:24:06,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:06,429 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-11 21:24:06,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times [2019-01-11 21:24:06,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:06,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:06,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:06,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:06,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:06,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:06,539 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states. [2019-01-11 21:24:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:06,935 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions. [2019-01-11 21:24:06,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:06,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-11 21:24:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:06,940 INFO L225 Difference]: With dead ends: 411 [2019-01-11 21:24:06,940 INFO L226 Difference]: Without dead ends: 231 [2019-01-11 21:24:06,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-11 21:24:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-01-11 21:24:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 21:24:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions. [2019-01-11 21:24:06,974 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39 [2019-01-11 21:24:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:06,975 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions. [2019-01-11 21:24:06,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions. [2019-01-11 21:24:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 21:24:06,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:06,977 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-11 21:24:06,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times [2019-01-11 21:24:06,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:06,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:07,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:07,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,121 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states. [2019-01-11 21:24:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:07,432 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions. [2019-01-11 21:24:07,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:07,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-11 21:24:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:07,435 INFO L225 Difference]: With dead ends: 460 [2019-01-11 21:24:07,435 INFO L226 Difference]: Without dead ends: 242 [2019-01-11 21:24:07,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-11 21:24:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-01-11 21:24:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 21:24:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions. [2019-01-11 21:24:07,452 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40 [2019-01-11 21:24:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions. [2019-01-11 21:24:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions. [2019-01-11 21:24:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 21:24:07,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:07,456 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-11 21:24:07,456 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times [2019-01-11 21:24:07,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:07,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:07,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:07,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:07,563 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-11 21:24:07,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:07,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:07,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:07,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:07,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,565 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states. [2019-01-11 21:24:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,040 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions. [2019-01-11 21:24:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-01-11 21:24:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,045 INFO L225 Difference]: With dead ends: 504 [2019-01-11 21:24:08,045 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 21:24:08,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 21:24:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-01-11 21:24:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 21:24:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions. [2019-01-11 21:24:08,062 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58 [2019-01-11 21:24:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,062 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions. [2019-01-11 21:24:08,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions. [2019-01-11 21:24:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 21:24:08,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:08,066 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-11 21:24:08,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times [2019-01-11 21:24:08,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:08,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:08,160 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-11 21:24:08,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:08,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:08,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,163 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states. [2019-01-11 21:24:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,426 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions. [2019-01-11 21:24:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-11 21:24:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,430 INFO L225 Difference]: With dead ends: 529 [2019-01-11 21:24:08,430 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 21:24:08,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 21:24:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-01-11 21:24:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 21:24:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions. [2019-01-11 21:24:08,443 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59 [2019-01-11 21:24:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,444 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions. [2019-01-11 21:24:08,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions. [2019-01-11 21:24:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 21:24:08,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:08,446 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-11 21:24:08,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:08,447 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times [2019-01-11 21:24:08,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:08,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:08,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:08,562 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-11 21:24:08,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:08,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:08,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:08,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,564 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states. [2019-01-11 21:24:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,799 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions. [2019-01-11 21:24:08,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-11 21:24:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,811 INFO L225 Difference]: With dead ends: 546 [2019-01-11 21:24:08,811 INFO L226 Difference]: Without dead ends: 292 [2019-01-11 21:24:08,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-11 21:24:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-01-11 21:24:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 21:24:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions. [2019-01-11 21:24:08,825 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60 [2019-01-11 21:24:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,825 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions. [2019-01-11 21:24:08,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions. [2019-01-11 21:24:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 21:24:08,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:08,828 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-11 21:24:08,829 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times [2019-01-11 21:24:08,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:08,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:08,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:08,908 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-11 21:24:08,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:08,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:08,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:08,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:08,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,911 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states. [2019-01-11 21:24:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,004 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-11 21:24:10,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-11 21:24:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,007 INFO L225 Difference]: With dead ends: 594 [2019-01-11 21:24:10,007 INFO L226 Difference]: Without dead ends: 309 [2019-01-11 21:24:10,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-11 21:24:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2019-01-11 21:24:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-11 21:24:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions. [2019-01-11 21:24:10,019 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72 [2019-01-11 21:24:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:10,020 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions. [2019-01-11 21:24:10,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions. [2019-01-11 21:24:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 21:24:10,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:10,021 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-11 21:24:10,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times [2019-01-11 21:24:10,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:10,104 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-11 21:24:10,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:10,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:10,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,105 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states. [2019-01-11 21:24:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,343 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions. [2019-01-11 21:24:10,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-11 21:24:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,348 INFO L225 Difference]: With dead ends: 645 [2019-01-11 21:24:10,348 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 21:24:10,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 21:24:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-11 21:24:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-11 21:24:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions. [2019-01-11 21:24:10,366 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72 [2019-01-11 21:24:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:10,368 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions. [2019-01-11 21:24:10,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions. [2019-01-11 21:24:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 21:24:10,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:10,370 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-11 21:24:10,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times [2019-01-11 21:24:10,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:10,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:10,450 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-11 21:24:10,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:10,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:10,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:10,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,453 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states. [2019-01-11 21:24:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:10,834 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions. [2019-01-11 21:24:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:10,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-11 21:24:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:10,838 INFO L225 Difference]: With dead ends: 681 [2019-01-11 21:24:10,838 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 21:24:10,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 21:24:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-11 21:24:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-11 21:24:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions. [2019-01-11 21:24:10,854 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73 [2019-01-11 21:24:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:10,854 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions. [2019-01-11 21:24:10,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions. [2019-01-11 21:24:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 21:24:10,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:10,856 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-11 21:24:10,860 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times [2019-01-11 21:24:10,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:10,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:10,958 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-11 21:24:10,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:10,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:10,960 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states. [2019-01-11 21:24:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:11,472 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions. [2019-01-11 21:24:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:11,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-11 21:24:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:11,477 INFO L225 Difference]: With dead ends: 681 [2019-01-11 21:24:11,477 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 21:24:11,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 21:24:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-01-11 21:24:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-11 21:24:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2019-01-11 21:24:11,492 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73 [2019-01-11 21:24:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:11,492 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2019-01-11 21:24:11,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2019-01-11 21:24:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 21:24:11,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:11,494 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-11 21:24:11,495 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times [2019-01-11 21:24:11,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:11,603 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-11 21:24:11,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:11,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:11,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:11,605 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states. [2019-01-11 21:24:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:12,251 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2019-01-11 21:24:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-11 21:24:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:12,254 INFO L225 Difference]: With dead ends: 708 [2019-01-11 21:24:12,254 INFO L226 Difference]: Without dead ends: 372 [2019-01-11 21:24:12,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-01-11 21:24:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-01-11 21:24:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 21:24:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions. [2019-01-11 21:24:12,266 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79 [2019-01-11 21:24:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:12,267 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions. [2019-01-11 21:24:12,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions. [2019-01-11 21:24:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 21:24:12,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:12,268 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-11 21:24:12,268 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times [2019-01-11 21:24:12,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:12,311 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-11 21:24:12,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:12,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:12,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,312 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states. [2019-01-11 21:24:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:12,865 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions. [2019-01-11 21:24:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:12,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-11 21:24:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:12,869 INFO L225 Difference]: With dead ends: 732 [2019-01-11 21:24:12,869 INFO L226 Difference]: Without dead ends: 372 [2019-01-11 21:24:12,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-01-11 21:24:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-01-11 21:24:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 21:24:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions. [2019-01-11 21:24:12,882 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80 [2019-01-11 21:24:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:12,882 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions. [2019-01-11 21:24:12,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions. [2019-01-11 21:24:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:24:12,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:12,884 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-11 21:24:12,884 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times [2019-01-11 21:24:12,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:12,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:12,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:12,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:12,955 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-11 21:24:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:12,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:12,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,956 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states. [2019-01-11 21:24:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:13,362 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions. [2019-01-11 21:24:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:13,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:24:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:13,366 INFO L225 Difference]: With dead ends: 736 [2019-01-11 21:24:13,366 INFO L226 Difference]: Without dead ends: 376 [2019-01-11 21:24:13,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-01-11 21:24:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-01-11 21:24:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-11 21:24:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2019-01-11 21:24:13,381 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85 [2019-01-11 21:24:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:13,381 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2019-01-11 21:24:13,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2019-01-11 21:24:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 21:24:13,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:13,383 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-11 21:24:13,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times [2019-01-11 21:24:13,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:13,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:13,465 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-11 21:24:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:13,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:13,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:13,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,466 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states. [2019-01-11 21:24:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:13,857 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions. [2019-01-11 21:24:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:13,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-11 21:24:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:13,861 INFO L225 Difference]: With dead ends: 776 [2019-01-11 21:24:13,861 INFO L226 Difference]: Without dead ends: 407 [2019-01-11 21:24:13,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-01-11 21:24:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-01-11 21:24:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-11 21:24:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions. [2019-01-11 21:24:13,877 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86 [2019-01-11 21:24:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:13,877 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions. [2019-01-11 21:24:13,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions. [2019-01-11 21:24:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-11 21:24:13,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:13,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11 21:24:13,880 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times [2019-01-11 21:24:13,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:13,958 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-11 21:24:13,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:13,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:13,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,960 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states. [2019-01-11 21:24:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:14,166 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions. [2019-01-11 21:24:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:14,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-01-11 21:24:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:14,169 INFO L225 Difference]: With dead ends: 805 [2019-01-11 21:24:14,169 INFO L226 Difference]: Without dead ends: 407 [2019-01-11 21:24:14,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-01-11 21:24:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2019-01-11 21:24:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-11 21:24:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions. [2019-01-11 21:24:14,183 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87 [2019-01-11 21:24:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:14,183 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions. [2019-01-11 21:24:14,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions. [2019-01-11 21:24:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:24:14,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:14,185 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-11 21:24:14,185 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times [2019-01-11 21:24:14,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:14,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:14,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:14,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:14,262 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-11 21:24:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:14,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:14,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:14,263 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states. [2019-01-11 21:24:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:15,134 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions. [2019-01-11 21:24:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:15,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:24:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:15,137 INFO L225 Difference]: With dead ends: 828 [2019-01-11 21:24:15,138 INFO L226 Difference]: Without dead ends: 430 [2019-01-11 21:24:15,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-11 21:24:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-01-11 21:24:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-11 21:24:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions. [2019-01-11 21:24:15,151 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100 [2019-01-11 21:24:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:15,152 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions. [2019-01-11 21:24:15,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions. [2019-01-11 21:24:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 21:24:15,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:15,153 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-11 21:24:15,154 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:15,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times [2019-01-11 21:24:15,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:15,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:15,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:15,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:15,226 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-11 21:24:15,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:15,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:15,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,227 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states. [2019-01-11 21:24:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:15,544 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions. [2019-01-11 21:24:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:15,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-11 21:24:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:15,547 INFO L225 Difference]: With dead ends: 849 [2019-01-11 21:24:15,547 INFO L226 Difference]: Without dead ends: 430 [2019-01-11 21:24:15,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-11 21:24:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2019-01-11 21:24:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-11 21:24:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2019-01-11 21:24:15,559 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101 [2019-01-11 21:24:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:15,560 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2019-01-11 21:24:15,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2019-01-11 21:24:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 21:24:15,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:15,561 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-11 21:24:15,562 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times [2019-01-11 21:24:15,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:15,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:15,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:15,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:15,626 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-11 21:24:15,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:15,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:15,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,628 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states. [2019-01-11 21:24:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:15,972 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions. [2019-01-11 21:24:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:15,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-11 21:24:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:15,976 INFO L225 Difference]: With dead ends: 890 [2019-01-11 21:24:15,976 INFO L226 Difference]: Without dead ends: 471 [2019-01-11 21:24:15,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-01-11 21:24:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2019-01-11 21:24:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-01-11 21:24:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions. [2019-01-11 21:24:15,991 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102 [2019-01-11 21:24:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:15,991 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions. [2019-01-11 21:24:15,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions. [2019-01-11 21:24:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 21:24:15,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:15,993 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-11 21:24:15,993 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:15,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times [2019-01-11 21:24:15,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:15,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:15,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:16,068 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-11 21:24:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:16,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:16,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:16,070 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states. [2019-01-11 21:24:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:16,332 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions. [2019-01-11 21:24:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:16,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-11 21:24:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:16,335 INFO L225 Difference]: With dead ends: 965 [2019-01-11 21:24:16,336 INFO L226 Difference]: Without dead ends: 504 [2019-01-11 21:24:16,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-01-11 21:24:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2019-01-11 21:24:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-01-11 21:24:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions. [2019-01-11 21:24:16,350 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103 [2019-01-11 21:24:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:16,350 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions. [2019-01-11 21:24:16,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions. [2019-01-11 21:24:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 21:24:16,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:16,352 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-11 21:24:16,352 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times [2019-01-11 21:24:16,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:16,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:16,428 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-11 21:24:16,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:16,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:16,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:16,429 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states. [2019-01-11 21:24:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,140 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions. [2019-01-11 21:24:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-01-11 21:24:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,144 INFO L225 Difference]: With dead ends: 1004 [2019-01-11 21:24:17,144 INFO L226 Difference]: Without dead ends: 507 [2019-01-11 21:24:17,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-01-11 21:24:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-01-11 21:24:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-11 21:24:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions. [2019-01-11 21:24:17,159 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103 [2019-01-11 21:24:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:17,159 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions. [2019-01-11 21:24:17,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions. [2019-01-11 21:24:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:24:17,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:17,161 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-11 21:24:17,161 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times [2019-01-11 21:24:17,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:17,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,236 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-11 21:24:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:17,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,237 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states. [2019-01-11 21:24:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,814 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions. [2019-01-11 21:24:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:24:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,819 INFO L225 Difference]: With dead ends: 1003 [2019-01-11 21:24:17,819 INFO L226 Difference]: Without dead ends: 506 [2019-01-11 21:24:17,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-01-11 21:24:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-01-11 21:24:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-01-11 21:24:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions. [2019-01-11 21:24:17,833 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104 [2019-01-11 21:24:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:17,834 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions. [2019-01-11 21:24:17,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions. [2019-01-11 21:24:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-11 21:24:17,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:17,836 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-11 21:24:17,836 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times [2019-01-11 21:24:17,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,916 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-11 21:24:17,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:17,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:17,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:17,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:17,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,917 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states. [2019-01-11 21:24:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,970 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions. [2019-01-11 21:24:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-11 21:24:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,978 INFO L225 Difference]: With dead ends: 1491 [2019-01-11 21:24:17,978 INFO L226 Difference]: Without dead ends: 994 [2019-01-11 21:24:17,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-01-11 21:24:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505. [2019-01-11 21:24:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-11 21:24:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions. [2019-01-11 21:24:17,999 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116 [2019-01-11 21:24:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions. [2019-01-11 21:24:18,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions. [2019-01-11 21:24:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-11 21:24:18,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:18,002 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-11 21:24:18,002 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times [2019-01-11 21:24:18,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:18,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:18,110 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-11 21:24:18,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:18,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,114 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states. [2019-01-11 21:24:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:18,401 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions. [2019-01-11 21:24:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:18,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-11 21:24:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:18,408 INFO L225 Difference]: With dead ends: 1499 [2019-01-11 21:24:18,408 INFO L226 Difference]: Without dead ends: 1001 [2019-01-11 21:24:18,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-01-11 21:24:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2019-01-11 21:24:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-01-11 21:24:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions. [2019-01-11 21:24:18,458 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116 [2019-01-11 21:24:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,459 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions. [2019-01-11 21:24:18,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions. [2019-01-11 21:24:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-11 21:24:18,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:18,460 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-11 21:24:18,463 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times [2019-01-11 21:24:18,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:18,551 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-11 21:24:18,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:18,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:18,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,555 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states. [2019-01-11 21:24:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:19,133 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions. [2019-01-11 21:24:19,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:19,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-01-11 21:24:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:19,144 INFO L225 Difference]: With dead ends: 2493 [2019-01-11 21:24:19,144 INFO L226 Difference]: Without dead ends: 1499 [2019-01-11 21:24:19,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-01-11 21:24:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497. [2019-01-11 21:24:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-01-11 21:24:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions. [2019-01-11 21:24:19,204 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118 [2019-01-11 21:24:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:19,205 INFO L480 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions. [2019-01-11 21:24:19,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions. [2019-01-11 21:24:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-11 21:24:19,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:19,209 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-11 21:24:19,209 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times [2019-01-11 21:24:19,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:19,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:19,296 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-11 21:24:19,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:19,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:19,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,299 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states. [2019-01-11 21:24:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:19,916 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions. [2019-01-11 21:24:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:19,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-01-11 21:24:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:19,931 INFO L225 Difference]: With dead ends: 1997 [2019-01-11 21:24:19,931 INFO L226 Difference]: Without dead ends: 1995 [2019-01-11 21:24:19,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-01-11 21:24:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2019-01-11 21:24:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-01-11 21:24:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions. [2019-01-11 21:24:20,029 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119 [2019-01-11 21:24:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:20,030 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions. [2019-01-11 21:24:20,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions. [2019-01-11 21:24:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-11 21:24:20,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:20,036 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-11 21:24:20,038 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times [2019-01-11 21:24:20,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:20,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:20,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:20,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:20,135 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-11 21:24:20,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:20,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:20,137 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states. [2019-01-11 21:24:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:20,915 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions. [2019-01-11 21:24:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:20,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-01-11 21:24:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:20,927 INFO L225 Difference]: With dead ends: 4167 [2019-01-11 21:24:20,928 INFO L226 Difference]: Without dead ends: 2181 [2019-01-11 21:24:20,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-01-11 21:24:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157. [2019-01-11 21:24:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-01-11 21:24:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions. [2019-01-11 21:24:21,007 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149 [2019-01-11 21:24:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:21,007 INFO L480 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions. [2019-01-11 21:24:21,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions. [2019-01-11 21:24:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 21:24:21,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:21,012 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-11 21:24:21,012 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times [2019-01-11 21:24:21,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:21,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:21,104 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-11 21:24:21,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:21,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:21,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:21,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:21,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:21,105 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states. [2019-01-11 21:24:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:21,330 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions. [2019-01-11 21:24:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:21,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-01-11 21:24:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:21,339 INFO L225 Difference]: With dead ends: 4331 [2019-01-11 21:24:21,339 INFO L226 Difference]: Without dead ends: 2149 [2019-01-11 21:24:21,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2019-01-11 21:24:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125. [2019-01-11 21:24:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-11 21:24:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions. [2019-01-11 21:24:21,403 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150 [2019-01-11 21:24:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:21,403 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions. [2019-01-11 21:24:21,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions. [2019-01-11 21:24:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-11 21:24:21,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:21,407 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-11 21:24:21,407 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times [2019-01-11 21:24:21,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:21,610 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-11 21:24:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:21,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:21,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:21,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:21,880 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-11 21:24:21,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:21,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:21,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:21,910 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 5 states. [2019-01-11 21:24:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:24,715 INFO L93 Difference]: Finished difference Result 7438 states and 10941 transitions. [2019-01-11 21:24:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:24,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-01-11 21:24:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:24,738 INFO L225 Difference]: With dead ends: 7438 [2019-01-11 21:24:24,739 INFO L226 Difference]: Without dead ends: 5255 [2019-01-11 21:24:24,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 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-11 21:24:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2019-01-11 21:24:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 2974. [2019-01-11 21:24:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-01-11 21:24:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4315 transitions. [2019-01-11 21:24:24,875 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4315 transitions. Word has length 182 [2019-01-11 21:24:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 2974 states and 4315 transitions. [2019-01-11 21:24:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4315 transitions. [2019-01-11 21:24:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 21:24:24,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:24,883 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-11 21:24:24,883 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times [2019-01-11 21:24:24,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:24,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:24,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:24,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:24,996 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-11 21:24:24,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:24,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:24,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:24,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:24,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:24,998 INFO L87 Difference]: Start difference. First operand 2974 states and 4315 transitions. Second operand 3 states. [2019-01-11 21:24:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:25,369 INFO L93 Difference]: Finished difference Result 4755 states and 6900 transitions. [2019-01-11 21:24:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:25,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-11 21:24:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:25,384 INFO L225 Difference]: With dead ends: 4755 [2019-01-11 21:24:25,385 INFO L226 Difference]: Without dead ends: 3567 [2019-01-11 21:24:25,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2019-01-11 21:24:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3567. [2019-01-11 21:24:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-11 21:24:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 5178 transitions. [2019-01-11 21:24:25,478 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 5178 transitions. Word has length 186 [2019-01-11 21:24:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:25,479 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 5178 transitions. [2019-01-11 21:24:25,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 5178 transitions. [2019-01-11 21:24:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-11 21:24:25,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:25,487 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-11 21:24:25,487 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times [2019-01-11 21:24:25,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:25,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:25,647 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-11 21:24:25,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:25,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:25,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:25,650 INFO L87 Difference]: Start difference. First operand 3567 states and 5178 transitions. Second operand 3 states. [2019-01-11 21:24:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:26,329 INFO L93 Difference]: Finished difference Result 7187 states and 10417 transitions. [2019-01-11 21:24:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:26,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-01-11 21:24:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:26,339 INFO L225 Difference]: With dead ends: 7187 [2019-01-11 21:24:26,339 INFO L226 Difference]: Without dead ends: 3627 [2019-01-11 21:24:26,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2019-01-11 21:24:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3567. [2019-01-11 21:24:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-11 21:24:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 5130 transitions. [2019-01-11 21:24:26,431 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 5130 transitions. Word has length 264 [2019-01-11 21:24:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:26,431 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 5130 transitions. [2019-01-11 21:24:26,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 5130 transitions. [2019-01-11 21:24:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-11 21:24:26,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:26,436 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-11 21:24:26,437 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times [2019-01-11 21:24:26,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:26,541 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-11 21:24:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:26,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:26,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:26,543 INFO L87 Difference]: Start difference. First operand 3567 states and 5130 transitions. Second operand 3 states. [2019-01-11 21:24:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:27,896 INFO L93 Difference]: Finished difference Result 7217 states and 10351 transitions. [2019-01-11 21:24:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:27,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-01-11 21:24:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:27,905 INFO L225 Difference]: With dead ends: 7217 [2019-01-11 21:24:27,906 INFO L226 Difference]: Without dead ends: 3657 [2019-01-11 21:24:27,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-11 21:24:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3567. [2019-01-11 21:24:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-11 21:24:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4914 transitions. [2019-01-11 21:24:28,055 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4914 transitions. Word has length 268 [2019-01-11 21:24:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:28,056 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 4914 transitions. [2019-01-11 21:24:28,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4914 transitions. [2019-01-11 21:24:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-01-11 21:24:28,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:28,064 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-11 21:24:28,064 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times [2019-01-11 21:24:28,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:28,177 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-11 21:24:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:28,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:28,180 INFO L87 Difference]: Start difference. First operand 3567 states and 4914 transitions. Second operand 3 states. [2019-01-11 21:24:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:29,278 INFO L93 Difference]: Finished difference Result 7217 states and 9927 transitions. [2019-01-11 21:24:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:29,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-01-11 21:24:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:29,287 INFO L225 Difference]: With dead ends: 7217 [2019-01-11 21:24:29,287 INFO L226 Difference]: Without dead ends: 3657 [2019-01-11 21:24:29,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-11 21:24:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3567. [2019-01-11 21:24:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-11 21:24:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 4854 transitions. [2019-01-11 21:24:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 4854 transitions. Word has length 278 [2019-01-11 21:24:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:29,422 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 4854 transitions. [2019-01-11 21:24:29,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4854 transitions. [2019-01-11 21:24:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-11 21:24:29,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:29,430 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-11 21:24:29,430 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2088848437, now seen corresponding path program 1 times [2019-01-11 21:24:29,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:29,555 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-11 21:24:29,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:29,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:29,558 INFO L87 Difference]: Start difference. First operand 3567 states and 4854 transitions. Second operand 3 states. [2019-01-11 21:24:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:29,947 INFO L93 Difference]: Finished difference Result 7385 states and 10039 transitions. [2019-01-11 21:24:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:29,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-01-11 21:24:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:29,955 INFO L225 Difference]: With dead ends: 7385 [2019-01-11 21:24:29,955 INFO L226 Difference]: Without dead ends: 3717 [2019-01-11 21:24:29,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2019-01-11 21:24:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3657. [2019-01-11 21:24:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2019-01-11 21:24:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4926 transitions. [2019-01-11 21:24:30,100 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4926 transitions. Word has length 297 [2019-01-11 21:24:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:30,101 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 4926 transitions. [2019-01-11 21:24:30,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4926 transitions. [2019-01-11 21:24:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-11 21:24:30,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:30,111 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-11 21:24:30,111 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times [2019-01-11 21:24:30,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:30,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:30,334 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-11 21:24:30,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:30,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:30,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:30,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:30,536 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-11 21:24:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:30,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:30,555 INFO L87 Difference]: Start difference. First operand 3657 states and 4926 transitions. Second operand 4 states. [2019-01-11 21:24:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:31,208 INFO L93 Difference]: Finished difference Result 8564 states and 11406 transitions. [2019-01-11 21:24:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:24:31,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-01-11 21:24:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:31,218 INFO L225 Difference]: With dead ends: 8564 [2019-01-11 21:24:31,218 INFO L226 Difference]: Without dead ends: 4884 [2019-01-11 21:24:31,223 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-11 21:24:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2019-01-11 21:24:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 3471. [2019-01-11 21:24:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-01-11 21:24:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4626 transitions. [2019-01-11 21:24:31,333 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4626 transitions. Word has length 297 [2019-01-11 21:24:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:31,335 INFO L480 AbstractCegarLoop]: Abstraction has 3471 states and 4626 transitions. [2019-01-11 21:24:31,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4626 transitions. [2019-01-11 21:24:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-11 21:24:31,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:31,342 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-11 21:24:31,342 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -559976568, now seen corresponding path program 1 times [2019-01-11 21:24:31,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:31,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:31,455 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-11 21:24:31,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:31,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:31,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:31,459 INFO L87 Difference]: Start difference. First operand 3471 states and 4626 transitions. Second operand 3 states. [2019-01-11 21:24:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:31,711 INFO L93 Difference]: Finished difference Result 6991 states and 9327 transitions. [2019-01-11 21:24:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:31,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-01-11 21:24:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:31,715 INFO L225 Difference]: With dead ends: 6991 [2019-01-11 21:24:31,715 INFO L226 Difference]: Without dead ends: 3527 [2019-01-11 21:24:31,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2019-01-11 21:24:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3471. [2019-01-11 21:24:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2019-01-11 21:24:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 4620 transitions. [2019-01-11 21:24:31,886 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 4620 transitions. Word has length 298 [2019-01-11 21:24:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:31,887 INFO L480 AbstractCegarLoop]: Abstraction has 3471 states and 4620 transitions. [2019-01-11 21:24:31,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 4620 transitions. [2019-01-11 21:24:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-01-11 21:24:31,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:31,895 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-11 21:24:31,896 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -50095736, now seen corresponding path program 1 times [2019-01-11 21:24:31,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:31,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:32,126 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-11 21:24:32,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:32,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:32,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:32,455 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-11 21:24:32,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:32,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:32,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:32,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:32,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:32,502 INFO L87 Difference]: Start difference. First operand 3471 states and 4620 transitions. Second operand 5 states. [2019-01-11 21:24:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:34,280 INFO L93 Difference]: Finished difference Result 10969 states and 14359 transitions. [2019-01-11 21:24:34,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:34,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 309 [2019-01-11 21:24:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:34,287 INFO L225 Difference]: With dead ends: 10969 [2019-01-11 21:24:34,288 INFO L226 Difference]: Without dead ends: 7505 [2019-01-11 21:24:34,292 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-11 21:24:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-11 21:24:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 4467. [2019-01-11 21:24:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-01-11 21:24:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5723 transitions. [2019-01-11 21:24:34,491 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5723 transitions. Word has length 309 [2019-01-11 21:24:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:34,491 INFO L480 AbstractCegarLoop]: Abstraction has 4467 states and 5723 transitions. [2019-01-11 21:24:34,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5723 transitions. [2019-01-11 21:24:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-11 21:24:34,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:34,500 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-11 21:24:34,501 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times [2019-01-11 21:24:34,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:34,643 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-11 21:24:34,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:34,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:34,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:34,648 INFO L87 Difference]: Start difference. First operand 4467 states and 5723 transitions. Second operand 3 states. [2019-01-11 21:24:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:35,168 INFO L93 Difference]: Finished difference Result 9002 states and 11510 transitions. [2019-01-11 21:24:35,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:35,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-11 21:24:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:35,173 INFO L225 Difference]: With dead ends: 9002 [2019-01-11 21:24:35,173 INFO L226 Difference]: Without dead ends: 4542 [2019-01-11 21:24:35,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2019-01-11 21:24:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4467. [2019-01-11 21:24:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-01-11 21:24:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5633 transitions. [2019-01-11 21:24:35,315 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5633 transitions. Word has length 321 [2019-01-11 21:24:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:35,316 INFO L480 AbstractCegarLoop]: Abstraction has 4467 states and 5633 transitions. [2019-01-11 21:24:35,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5633 transitions. [2019-01-11 21:24:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-11 21:24:35,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:35,323 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-11 21:24:35,323 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash 8891195, now seen corresponding path program 1 times [2019-01-11 21:24:35,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:35,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:35,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:35,607 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-11 21:24:35,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:35,608 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-11 21:24:35,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:35,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:35,857 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-11 21:24:35,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:35,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:35,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:35,887 INFO L87 Difference]: Start difference. First operand 4467 states and 5633 transitions. Second operand 5 states. [2019-01-11 21:24:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:36,717 INFO L93 Difference]: Finished difference Result 12027 states and 15128 transitions. [2019-01-11 21:24:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:24:36,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-01-11 21:24:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:36,727 INFO L225 Difference]: With dead ends: 12027 [2019-01-11 21:24:36,727 INFO L226 Difference]: Without dead ends: 7567 [2019-01-11 21:24:36,734 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-11 21:24:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-01-11 21:24:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 4527. [2019-01-11 21:24:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-01-11 21:24:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 5636 transitions. [2019-01-11 21:24:36,921 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 5636 transitions. Word has length 364 [2019-01-11 21:24:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:36,921 INFO L480 AbstractCegarLoop]: Abstraction has 4527 states and 5636 transitions. [2019-01-11 21:24:36,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5636 transitions. [2019-01-11 21:24:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-01-11 21:24:36,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:36,929 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-11 21:24:36,929 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:36,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:36,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times [2019-01-11 21:24:36,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:36,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:37,114 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-11 21:24:37,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:37,116 INFO L87 Difference]: Start difference. First operand 4527 states and 5636 transitions. Second operand 3 states. [2019-01-11 21:24:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:37,453 INFO L93 Difference]: Finished difference Result 7997 states and 9987 transitions. [2019-01-11 21:24:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:37,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-01-11 21:24:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:37,459 INFO L225 Difference]: With dead ends: 7997 [2019-01-11 21:24:37,459 INFO L226 Difference]: Without dead ends: 4539 [2019-01-11 21:24:37,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2019-01-11 21:24:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 4527. [2019-01-11 21:24:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2019-01-11 21:24:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 5630 transitions. [2019-01-11 21:24:37,587 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 5630 transitions. Word has length 387 [2019-01-11 21:24:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:37,588 INFO L480 AbstractCegarLoop]: Abstraction has 4527 states and 5630 transitions. [2019-01-11 21:24:37,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5630 transitions. [2019-01-11 21:24:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-01-11 21:24:37,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:37,594 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-11 21:24:37,594 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times [2019-01-11 21:24:37,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:37,747 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-11 21:24:37,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:37,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:37,749 INFO L87 Difference]: Start difference. First operand 4527 states and 5630 transitions. Second operand 3 states. [2019-01-11 21:24:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:38,048 INFO L93 Difference]: Finished difference Result 8462 states and 10531 transitions. [2019-01-11 21:24:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:38,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-01-11 21:24:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:38,053 INFO L225 Difference]: With dead ends: 8462 [2019-01-11 21:24:38,053 INFO L226 Difference]: Without dead ends: 3821 [2019-01-11 21:24:38,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-01-11 21:24:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3732. [2019-01-11 21:24:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-11 21:24:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 4603 transitions. [2019-01-11 21:24:38,159 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 4603 transitions. Word has length 387 [2019-01-11 21:24:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:38,159 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 4603 transitions. [2019-01-11 21:24:38,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 4603 transitions. [2019-01-11 21:24:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-11 21:24:38,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:38,165 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-11 21:24:38,166 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times [2019-01-11 21:24:38,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:38,458 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-11 21:24:38,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:38,458 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-11 21:24:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:38,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:38,616 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-11 21:24:38,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:38,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:38,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:38,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:38,637 INFO L87 Difference]: Start difference. First operand 3732 states and 4603 transitions. Second operand 4 states. [2019-01-11 21:24:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:38,882 INFO L93 Difference]: Finished difference Result 5758 states and 7115 transitions. [2019-01-11 21:24:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:24:38,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-01-11 21:24:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:38,883 INFO L225 Difference]: With dead ends: 5758 [2019-01-11 21:24:38,883 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:38,888 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-11 21:24:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:38,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2019-01-11 21:24:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:38,889 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:38,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:38,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:38,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:38,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:38,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,066 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 138 [2019-01-11 21:24:39,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,288 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 139 [2019-01-11 21:24:39,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,511 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 117 [2019-01-11 21:24:39,774 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 190 [2019-01-11 21:24:39,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:40,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,851 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 673 DAG size of output: 453 [2019-01-11 21:24:41,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:41,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:42,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,407 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 675 DAG size of output: 455 [2019-01-11 21:24:43,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:43,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:44,868 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 134 DAG size of output: 59 [2019-01-11 21:24:45,298 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 30 [2019-01-11 21:24:45,721 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-01-11 21:24:46,588 WARN L181 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 61 [2019-01-11 21:24:47,242 WARN L181 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-11 21:24:47,742 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 25 [2019-01-11 21:24:48,731 WARN L181 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 38 [2019-01-11 21:24:49,256 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-11 21:24:49,671 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-01-11 21:24:50,089 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 28 [2019-01-11 21:24:56,616 WARN L181 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 388 DAG size of output: 113 [2019-01-11 21:24:57,105 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-01-11 21:24:57,781 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 70 [2019-01-11 21:24:58,314 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 28 [2019-01-11 21:24:58,823 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 51 [2019-01-11 21:25:05,350 WARN L181 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 390 DAG size of output: 116 [2019-01-11 21:25:05,879 WARN L181 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 33 [2019-01-11 21:25:06,450 WARN L181 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-01-11 21:25:07,446 WARN L181 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 38 [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 611) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 562) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 573) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 584) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 595) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 603) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2019-01-11 21:25:07,450 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-11 21:25:07,454 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-11 21:25:07,454 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 595) the Hoare annotation is: false [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 503) no Hoare annotation was computed. [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 602) no Hoare annotation was computed. [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2019-01-11 21:25:07,454 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 561) no Hoare annotation was computed. [2019-01-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 572) no Hoare annotation was computed. [2019-01-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 583) no Hoare annotation was computed. [2019-01-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 594) no Hoare annotation was computed. [2019-01-11 21:25:07,455 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-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2019-01-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2019-01-11 21:25:07,455 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2019-01-11 21:25:07,455 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-11 21:25:07,456 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-11 21:25:07,459 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-11 21:25:07,459 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 540) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2019-01-11 21:25:07,460 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-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 571) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 582) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 593) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L451 ceAbstractionStarter]: At program point L637(lines 628 639) the Hoare annotation is: true [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 515) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2019-01-11 21:25:07,460 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-11 21:25:07,461 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,461 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 570) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 581) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 592) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 514) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 411) no Hoare annotation was computed. [2019-01-11 21:25:07,463 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-11 21:25:07,464 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 594) the Hoare annotation is: false [2019-01-11 21:25:07,464 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-11 21:25:07,464 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-11 21:25:07,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2019-01-11 21:25:07,464 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 569) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 580) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 591) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 552) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 568) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 579) no Hoare annotation was computed. [2019-01-11 21:25:07,465 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:25:07,466 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 590) no Hoare annotation was computed. [2019-01-11 21:25:07,468 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2019-01-11 21:25:07,468 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-11 21:25:07,469 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-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L451 ceAbstractionStarter]: At program point L615(lines 98 616) the Hoare annotation is: true [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 567) no Hoare annotation was computed. [2019-01-11 21:25:07,469 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 578) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 589) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 590) the Hoare annotation is: false [2019-01-11 21:25:07,470 INFO L444 ceAbstractionStarter]: At program point L485(lines 72 626) the Hoare annotation is: false [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L452(lines 452 461) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:25:07,470 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,470 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-11 21:25:07,471 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 566) no Hoare annotation was computed. [2019-01-11 21:25:07,471 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 577) no Hoare annotation was computed. [2019-01-11 21:25:07,474 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 588) no Hoare annotation was computed. [2019-01-11 21:25:07,474 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:25:07,474 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 626) no Hoare annotation was computed. [2019-01-11 21:25:07,474 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 489) no Hoare annotation was computed. [2019-01-11 21:25:07,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:25:07,475 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-11 21:25:07,475 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-11 21:25:07,475 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-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 622) no Hoare annotation was computed. [2019-01-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2019-01-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 524) no Hoare annotation was computed. [2019-01-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-01-11 21:25:07,475 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 565) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 576) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 587) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 494) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L490-2(lines 490 494) no Hoare annotation was computed. [2019-01-11 21:25:07,476 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-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-11 21:25:07,476 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 564) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 575) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 586) no Hoare annotation was computed. [2019-01-11 21:25:07,477 INFO L451 ceAbstractionStarter]: At program point L625(lines 11 627) the Hoare annotation is: true [2019-01-11 21:25:07,478 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-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-01-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2019-01-11 21:25:07,478 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-11 21:25:07,478 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-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-01-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 563) no Hoare annotation was computed. [2019-01-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 574) no Hoare annotation was computed. [2019-01-11 21:25:07,478 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 585) no Hoare annotation was computed. [2019-01-11 21:25:07,481 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-11 21:25:07,482 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 531) no Hoare annotation was computed. [2019-01-11 21:25:07,482 INFO L448 ceAbstractionStarter]: For program point L529-2(lines 208 558) no Hoare annotation was computed. [2019-01-11 21:25:07,482 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-11 21:25:07,482 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-11 21:25:07,482 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-11 21:25:07,482 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:25:07,482 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 612) no Hoare annotation was computed. [2019-01-11 21:25:07,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:25:07 BoogieIcfgContainer [2019-01-11 21:25:07,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:25:07,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:25:07,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:25:07,562 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:25:07,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:04" (3/4) ... [2019-01-11 21:25:07,570 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:25:07,606 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:25:07,608 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:25:07,775 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:25:07,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:25:07,776 INFO L168 Benchmark]: Toolchain (without parser) took 65426.79 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 997.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:07,777 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:07,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:07,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:07,779 INFO L168 Benchmark]: Boogie Preprocessor took 40.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:07,779 INFO L168 Benchmark]: RCFGBuilder took 1294.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:07,780 INFO L168 Benchmark]: TraceAbstraction took 63293.35 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-11 21:25:07,783 INFO L168 Benchmark]: Witness Printer took 213.72 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-11 21:25:07,787 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 445.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1294.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63293.35 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 213.72 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 63.1s OverallTime, 42 OverallIterations, 14 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 28.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 7896 SDtfs, 6476 SDslu, 4190 SDs, 0 SdLazy, 5161 SolverSat, 1494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.8s 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.4s AutomataMinimizationTime, 42 MinimizatonAttempts, 10947 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 258 NumberOfFragments, 2449 HoareAnnotationTreeSize, 28 FomulaSimplifications, 646920 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 274733 FormulaSimplificationTreeSizeReductionInter, 23.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s 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...